• Journal of KIISE:Software and Applications
• /
• v.27 no.1
• /
• pp.41-49
• /
• 2000

This paper describes a method of generating MPHFs(Minimal Perfect Hash Functions) for large static search key sets. The MOS(Mapping-Ordering-Searching) approach is widely used presently in MPHF generation. In this research, the MOS approach is improved and a SOMS(Selecting-Ordering-Mapping-Searching) approach is proposed, where the Selecting step is newly introduced and the Orderng step is performed before the Mapping step to generate MPHFs more effectively. The MPHF generation algorithm proposed in this research is probabilistic and the expected processing time is linear to the number of keys. Experimental results show that MPHFs are generated fast and the space needed to represent the hash functions is small.

• Health Policy and Management
• /
• v.20 no.3
• /
• pp.138-156
• /
• 2010

Objective : The purpose of this study is 1) to understand the information-searching behavior of health care consumers ; 2) to examine the relationship between the information-searching behavior of health-care consumers and regulatory variables such as socioeconomic factors, characteristics of medical utilization, and perceived risks ; and 3) to determine the factors that affect consumer satisfaction, especially with respect to information-searching behavior. Method : The data for this study were collected from 838 respondents in five university hospital located in three areas?Seoul, Gyeonggi province, and Chungchong province. As the first step of the study, we conducted a preliminary survey from September 23?26, 2008. At the second step, we conducted a survey on the effect of information-searching behavior on those individuals who had visited. Furthermore, personal interviews were conducted through a face-to-face survey between September 30 and October 17, 2008. Results : The major research findings that were obtained from the study were as follows : First, the age, educational level, and residential district were associated with information source utilization. Second, the level of information searching effort and quality of service had a significant effect on consumer satisfaction. Conclusion : These results show that it is essential for marketers to have in-depth knowledge about the young and educated people who actively search for information and about those who are in the prime of their life and rely on word-of-mouth communication from personal and experi in-al informers. Therefore, marketers should develop different marketing strategies to meet the needs of such consumers.

• Journal of Korea Multimedia Society
• /
• v.18 no.8
• /
• pp.943-949
• /
• 2015

A reader usually spends a lot of time browsing and searching word meaning in a dictionary, internet or smart applications in order to find the unknown words. In this paper, we propose a method to compensate this drawback. The proposed method introduces a vocabulary upon recognizing a word or group of words that was captured by a smart phone camera. Through this proposed method, organizing and editing words that were captured by smart phone, searching the dictionary data using bisection method, listening pronunciation with the use of speech synthesizer, building and editing of vocabulary stored in database are given as the features. A smart phone application for organizing English words was established. The proposed method significantly reduces the organizing time for unknown English words and increases the English learning efficiency.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2003.11a
• /
• pp.672-676
• /
• 2003

Recently, the importance of ship vibration is emerging due to the large scaling, high speed and lightning of ship. For pleasantness in a cabin, shipbuilders ask for strict vibration criteria and the degree of vibration level at a deckhouse became an important condition for taking order from customers. This study conducted optimum design to attenuate vibration level of a deckhouse to solve above problems. New method was implemented, that is NASTRAN external call type independence optimization method. The merit of this method is global searching after setting various object functions and design variables. The global optimization algorithm used here is R-Tabu search method, which has fast converging time and searching various size domains. By modeling similar type to ship structure, validity of the suggested method was investigated.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.251-260
• /
• 2006

Homology searching on the primary structure (i.e., amino acid arrangement) of protein sequences is an essential part in predicting the functions and evolutionary histories of proteins. However, proteins distant in an evolutionary history do not conserve amino acid residue arrangements, while preserving their structures. Therefore, homology searching on proteins' secondary structure is quite important in finding out distant homology. In this manuscript, we propose an indexing scheme for efficient approximate searching on the secondary structure of protein sequences which can be easily implemented in RDBMS. Exploiting the concept of clustering and lookahead, the proposed indexing scheme processes three types of secondary structure queries (i.e., exact match, range match, and wildcard match) very quickly. To evaluate the performance of the proposed method, we conducted extensive experiments using a set of actual protein sequences. CSI was proved to be faster than the existing indexing methods up to 6.3 times in exact match, 3.3 times in range match, and 1.5 times in wildcard match, respectively.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.7
• /
• pp.3188-3193
• /
• 2012

It is important to search a pitch for vocoder. The major drawback to vocoders is their large computational requirements in searching a pitch and a codebook. In this paper, a simple method is proposed to improve the pitch searching process in the pitch filter almost without degradation of quality. The period of speech signal is emphasized by using Dual Pulse technique, the same type of autocorrelation method, in pitch search. Sometimes the incorrect pitch can be obtained by halving, doubling and trifling, To solve it, before searching a pitch, we estimate energy rate in a frame and compensate envelop of signal with it. By using the proposed algorithm in pitch search, its required computation are reduced and searching pitch is improved.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.1129-1135
• /
• 1999

isolated word recognition using the Dynamic Time warping algorithm has shown good recognition rate on speaker dependent environment. But, practically, since the searching time of the dynamic Time Warping algorithm is rapidly increased as searching data is increased. it is hard to implement. In the context-dependent-short-query system such as educational children's workbook on the Web, the number of responses to the specific questions is limited. Therefore, the searching space for the answers can be reduced depending on the questions. In this paper, low cost implementation method using DTW for the Web has been proposed. To cover the weakness of DTW, the searching space is reduced by the context. the searching space, depends on the specific questions, is chosen from interest searchable candidates. In the real implementation, the proposed method show better performance of both time and recognition rate.

• Journal of Internet Computing and Services
• /
• v.7 no.2
• /
• pp.71-80
• /
• 2006

In web search engines, there are two main methods: directory searching and keyword searching. Keyword searching shows high recall rate but tends to come up with too many search results to find which users want to see the pages. Directory searching has also a difficulty to find the pages that users want in case of selecting improper category without knowing the exact category, that is, it shows high precision rates but low recall rates. We designed and implemented a new web search engine to resolve the problems of directory search method. It regards a category as a fuzzy set which contains keywords and calculate the degree of inclusion between categories. The merit of this method is to enhance the recall rate of directory searching by expanding subcategories on the basis of similarity.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.2
• /
• pp.259-264
• /
• 2007

In this paper, we composed chaos mobile robot by embedding many type of chaos circuit including Arnold Equation and Chua's Equation and proposed method of evaluation of obstacles when it meets or approaches an obstacle while the mobile robot searches an any plane with chaos trajectory and method of concentrating search when it faces target and verified these results. For obstacles avoidance, we developed algorithm that evades an obstacles with chaos trajectory by assuming fixed obstacle, obstacles using VDP model, hidden obstacles using BVP model as obstacles and for searching an object, we developed algorithm of searching with a chaos trajectory by assuming BVP model as an object, verified the results and confirmed reasonability of them.

• Journal of Information Technology Services
• /
• v.13 no.1
• /
• pp.147-159
• /
• 2014

Recently, the quantity of information that is accessible from the Internet is being dramatically increased. Searching the Web for useful information has therefore become increasingly difficult. Thus, much research has been done on web robots which perform internet information filtering based on user interest. If a web site which users want to visit is found, its content is searched by following the searching list or Web sites links in order. This search process takes a long time according as the number of page or site increases so that its performance need to be improved. In order to minimize unnecessary search with web robots, this paper proposes an efficient information collection system based on compare and merge method. In the proposed system, a web robot initially collects information from web sites which users register. From the next visit to the web sites, the web robot compares what it collected with what the web sites have currently. If they are different, the web robot updates what it collected. Only updated web page information is classified according to subject and provided to users so that users can access the updated information quickly.