• Journal of Digital Contents Society
• /
• v.14 no.4
• /
• pp.463-469
• /
• 2013

The set-based POI search algorithm showed better performance than the existing hard matching search when inaccurate queries are entered. In the set-based POI search algorithm, however, there is a problem that can't classify duplicate characters within a record. This is due to it's 'set-based' search property. To solve this problem, we improve the existing set-based POI search algorithm. In this paper, we propose and implement an improved set-based POI search algorithm that is able to deal duplicate characters properly. From the experimental results, we can find that our technique for duplicate characters improves the performance of the existing set based POI search algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.2
• /
• pp.8-15
• /
• 2003

Recently various of information suppliers provide information via WWW so the necessary of search engine grows larger. However the efficiency of most search engines is low comparatively because of using simple pattern match technique between user's query and web document. A specialized search engine returns the specialized information depend on each user's search goal. It is trend to develop specialized search engines in many countries. However, most such engines don't satisfy the user's needs. This paper proposes the specialized search engine for ocean information that uses user's query related with ocean and the association rules in web data mining can prove relation between web documents. So this search engine improved the recall of data and the precision in existent search method.

• 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.

• The Journal of Korean Academic Society of Nursing Education
• /
• v.18 no.2
• /
• pp.259-267
• /
• 2012

Purpose: The purposes of this study were to build the career education course for nursing students' career development and to identify the effects of the education. Method: The study used a one-group pre- and post-test design and the surveys were carried out from April to June, 2011. The participants were 71 undergraduate seniors of department of nursing in E university. The data were obtained via questionnaires survey before and after taking the course. The collected data were analyzed by paired t-test using SPSS 19. Results: 88.7% of the subjects responded being satisfied with their major. The scores of career search efficacy (t=-2.57, p=.012), career exploration (t=-4.62, p<.001), and career adaptability (t=-3.51, p=.001) showed statistically significant improvement after the education. Networking (t=-2.66, p=.010) and personal exploration efficacy (t=-2.89, p=.005) showed statistically significant difference between pre- and post-test. Between two subgroup of career exploration, only the environment exploration (t=-5.92, p<.001) significantly improved. However, there was no significant difference in career identity. Conclusion: From this study, career education showed significant effects on the career search efficacy, career exploration, and career adaptability of nursing students. These findings suggest that career education as a subject would be an efficient way for career development of nursing students.

• International Journal of Computer Science & Network Security
• /
• v.21 no.9
• /
• pp.339-345
• /
• 2021

The rapid development of various applications in networking system, business, medical, education, and other domains that use basic data access operations such as insert, edit, delete and search makes data structure venerable and crucial in providing an efficient method for day to day operations of those numerous applications. One of the major problems of those applications is achieving constant time to search a key from a collection. A number of different methods which attempt to achieve that have been discovered by researchers over the years with different performance behaviors. This work evaluated these methods, and found out that almost all the existing methods have non-constant time for adding and searching a key. In this work, we designed a multi-indexes hashing algorithm that handles a collision in a hash table T efficiently and achieved constant time O(1) for searching and adding a key. Our method employed two-level of hashing which uses pattern extraction h₁(key) and h₂(key). The second hash function h₂(key) is use for handling collision in T. Here, we eliminated the wasted slots in the search space T which is another problem associated with the existing methods.

• The Journal of the Acoustical Society of Korea
• /
• v.30 no.3
• /
• pp.123-128
• /
• 2011

In this paper, we propose the improved noise power estimation in speech enhancement under various noise environments. The previous MS algorithm tracking the minimum value of finite search window uses the optimal power spectrum of signal for smoothing and adopts minimum probability. From the investigation of the previous MS-based methods it can be seen that a fixed size of the minimum search window is assumed regardless of the various environment. To achieve the different search window size, we use the noise classification algorithm based on the Gaussian mixture model (GMM). Performance of the proposed enhancement algorithm is evaluated by ITU-T P.862 perceptual evaluation of speech quality (PESQ) under various noise environments. Based on this, we show that the proposed algorithm yields better result compared to the conventional MS method.

• Journal of Korean Institute of Industrial Engineers
• /
• v.42 no.6
• /
• pp.377-385
• /
• 2016

The previous Adaptive Control of Thought-Rational (ACT-R) cognitive architecture model has a limitation in that it cannot accurately predict human visual search strategy, because time effect, one of important human cognitive features, is not considered. Thus, the present study proposes ACT-R cognitive modeling that contains the impact of time using a revised utility system in the ACT-R model. Then, the validation of the model is performed by comparing results of the model with eye-tracking experimental data and SEEV-T (SEEV-Time; SEEV model which considers time effect) model in "Where's Wally" game. The results demonstrate that the model data fit fairly well with the eye-tracking data ($R^2=0.91$) and SEEV-T model ($R^2=0.93$). Therefore, the modeling method which considers time effect using a revised utility system should be used in predicting the human visual search paradigm when the available time is limited.

• Journal of the Korean Home Economics Association
• /
• v.48 no.9
• /
• pp.41-54
• /
• 2010

This study attempted to determine how the subjective knowledge related to a consumer's life cycle influences their information search in the decision making process. The data was collected using a total of 349 questionnaires for the final analysis of this study. SPSS 12.0 for windows was used for the data analysis and the detailed analyses included descriptive analysis, factor analysis, reliability tests, one way ANOVA, multiple regression analysis and t-tests. The results of this study showed that there are differences in the subdivisions of subjective knowledge of apparel according to the consumer's life cycle and there is a difference in the types of information searches according to the consumer's subjective knowledge, and the subdivisions of subjective knowledge of the consumers influence their information search. This study showed that although it affected the internal search, the media search, and the store search, it did not influence the personal search in the decision making process.

• The Journal of the Korea Contents Association
• /
• v.8 no.11
• /
• pp.41-48
• /
• 2008

This study focuses on the modeling file search engine and suggesting modified file search schema based on weight value using file contents in order to improve the performance in terms of search accuracy and matching time. Most of the file search engines have used string matching algorithms like KMP(Knuth.Morris.Pratt), which may limit portability and fast searching time. However, this kind of algorithms don't find exactly the files what you want. Hence, the file search engine based on weight value using file contents is proposed here in order to optimize the performance for mobile environments. The Comparison with previous research shows that the proposed schema provides better.

• Journal of KIISE:Databases
• /
• v.36 no.4
• /
• pp.321-326
• /
• 2009

Since the existing Web search engines don't sufficiently reflect user's search intent, it is very difficult to find out accurate information that users want to find. Therefore, a lot of researches, study for personalized search, to enhance satisfaction of Web search results by analyzing search pattern and applying it to search are in progress in these days. Web searchers can more efficiently find information and easily obtain appropriate information through the personalized search. In this paper, we propose the personalized search based on community through the analysis of web users' query patterns and interest. Consequently, when applying query frequency, interest and community to web search, we are able to the confirm that the search results which hit to the search intent of the individual are provided.