• The Journal of the Korea Contents Association
• /
• v.15 no.11
• /
• pp.571-581
• /
• 2015

In the field of Korean medicine (KM), KM terms has been mixed used for a long period. After the Society of KM had systematically organized the KM terms used in our country, the book for the Korean medical standard terminologies was published. In this study, we developed an online service based on the book. The online service provides various useful functions for searching the terms and their commentary and collecting users' opinions. Users can also compare the standard terms with their semantic search results and naver's knowledge search results within our system. By analyzing logs of our system, we suggested several directions for future development, including the improvement of search functions, advertisements, and the provision of open APIs. In the future, our online service might provide the important information on clinics, academic researches, and international standards.

• Journal of the Korean Society for Library and Information Science
• /
• v.44 no.4
• /
• pp.395-412
• /
• 2010

This study aims to perform an evaluation of multimedia search services provided by major Korean search portals: Naver, Nate, Daum, Yahoo-Korea, Paran, and Google-Korea. These multimedia search services are evaluated in terms of the metadata of search results, search functionalities, searching methods, other functionalities, and display options. Every search portal offers image and video searching, whereas only Naver, Nate, and Daum offer music searching. Advanced searching methods and functions are mostly developed and supported in image and video searching rath than music searching. Naver, Nate, and Daum support various searching functions which search portals abroad have not developed. Google-Korea supports advanced searching functions. Search portals provide a limited number of metadata in search results. This study could contribute to the development and improvement of portal's multimedia search services.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12B
• /
• pp.1103-1111
• /
• 2008

Internet routers forward an incoming packet to an output port toward its final destination through IP address lookup. Since each incoming packet should be forwarded in wire-speed, it is essential to provide the high-speed search performance. In this paper, IP address lookup algorithms using binary search are studied. Most of the binary search algorithms do not provide a balanced search, and hence the required number of memory access is excessive so that the search performance is poor. On the other hand, binary-search-on-range algorithm provides high-speed search performance, but it requires a large amount of memory. This paper shows an optimized binary-search-on-range structure which reduces the memory requirement by deleting unnecessary entries and an entry field. By this optimization, it is shown that the binary-search-on-range can be performed in a routing table with a similar or lesser number of entries than the number of prefixes. Using real backbone routing data, the optimized structure is compared with the original binary-search-on-range algorithm in terms of search performance. The performance comparison with various binary search algorithms is also provided.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.12
• /
• pp.1219-1223
• /
• 2010

This paper proposes a fast motion estimation algorithm based on motion speed and multiple initial center points. The proposed method predicts initial search points by means of the spatio-temporal neighboring motion vectors. A dynamic search pattern based on the motion speed and the predicted initial center points is proposed to quickly obtain the motion vector. Due to the usage of the spatio-temporal information and the dynamic search pattern, the proposed method greatly accelerates the search speed while keeping a good predicted image quality. Experimental results show that the proposed method has a good predicted image quality in terms of PSNR with less searching time comparing with the Full Search, New Three-Step Search, and Four-Step Search.

• Journal of Advanced Marine Engineering and Technology
• /
• v.40 no.2
• /
• pp.138-145
• /
• 2016

This paper proposes an improved tabu search method for subset selection in multiple linear regression models. Variable selection is a vital combinatorial optimization problem in multivariate statistics. The selection of the optimal subset of variables is necessary in order to reliably construct a multiple linear regression model. Its applications widely range from machine learning, timeseries prediction, and multi-class classification to noise detection. Since this problem has NP-complete nature, it becomes more difficult to find the optimal solution as the number of variables increases. Two typical metaheuristic methods have been developed to tackle the problem: the tabu search algorithm and hybrid genetic and simulated annealing algorithm. However, these two methods have shortcomings. The tabu search method requires a large amount of computing time, and the hybrid algorithm produces a less accurate solution. To overcome the shortcomings of these methods, we propose an improved tabu search algorithm to reduce moves of the neighborhood and to adopt an effective move search strategy. To evaluate the performance of the proposed method, comparative studies are performed on small literature data sets and on large simulation data sets. Computational results show that the proposed method outperforms two metaheuristic methods in terms of the computing time and solution quality.

• International Journal of Knowledge Content Development & Technology
• /
• v.1 no.1
• /
• pp.7-24
• /
• 2011

This study aims to measure the impact of these two variables on consumers' 'click-through' rates (the number of users that click on the ad compared to the number of times the ad is delivered). The result is as follows. First, search ads play a critical role in drawing consumers to advertisers' websites. Once search ads are placed, the number of visitors increased tenfold. Secondly, when search ads are keyed to highly-involved words such as 'IDC', 'hosting' and 'co-location', click-through rates significantly fluctuate according to the type of advertising message. In this case, consumers respond much more positively to ads highlighting credibility and product quality than to ads with emphasis on sales and events. Thirdly, the placement of search ads also matters. The ad placed first in the search list overpowers ads in the third or fifth place in terms of click-through rates. However, there was no significant difference of click-through rates between ads in the third place and ads in fifth. Lastly, when estimating which variable plays the bigger role in bringing traffic to advertisers' websites, consumers are more receptive to the substance of the advertising message than to its placement, under the circumstances of high involvement.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.37 no.5
• /
• pp.293-302
• /
• 2019

In mountain accident events, it is important for the search team commander to determine the search area in order to secure the Golden Time. Within this period, assistance and treatment to the concerned individual will most likely prevent further injuries and harm. This paper proposes a method to determine the search priority area based on missing persons behavior and missing persons incidents statistics. GIS (Geographic Information System) and MCDM (Multi Criteria Decision Making) are integrated by applying WLC (Weighted Linear Combination) techniques. Missing persons were classified into five types, and their behavioral characteristics were analyzed to extract seven geographic analysis factors. Next, index values were set up for each missing person and element according to the behavioral characteristics, and the raster data generated by multiplying the weight of each element are superimposed to define models to select search priority areas, where each weight is calculated from the AHP (Analytical Hierarchy Process) through a pairwise comparison method obtained from search operation experts. Finally, the model generated in this study was applied to a missing person case through a virtual missing scenario, the priority area was selected, and the behavioral characteristics and topographical characteristics of the missing persons were compared with the selected area. The resulting analysis results were verified by mountain rescue experts as 'appropriate' in terms of the behavior analysis, analysis factor extraction, experimental process, and results for the missing persons.

• Science of Emotion and Sensibility
• /
• v.22 no.2
• /
• pp.49-58
• /
• 2019

In the era of the 4th Industrial Revolution, artificial intelligence (AI) has become one of the core technologies in terms of the business strategy among information technology companies. Both international and domestic major portal companies are launching AI search services. These AI search services utilize voice, images, and other unstructured data to provide different experiences from existing text-based search services. An unfamiliar experience is a factor that can hinder the usability of the service. Therefore, the usability testing of the AI search services is necessary. This study examines the usability of the AI search service on the Naver App 8.9.3 beta version by comparing it with the search services of the current Naver App and targets 30 people in their 20s and 30s, who have experience using Naver apps. The usability of Smart Lens, Smart Voice, Smart Around, and AiRS, which are the Naver App beta versions of their artificial intelligence search service, is evaluated and statistically significant usability changes are revealed. Smart Lens, Smart Voice, and Smart Around exhibited positive changes, whereas AiRS exhibited negative changes in terms of usability. This study evaluates the change in usability according to the application of the artificial intelligence search services and investigates the correlation between the evaluation factors. The obtained data are expected to be useful for the usability evaluation of services that use AI.

• Journal of Korean Library and Information Science Society
• /
• v.26
• /
• pp.365-400
• /
• 1997

The interface design for most present query-base model of OPAC systems does not include the function to implement an iterative feedback process till the user arrives at satisfied search results through the interaction with the system. Also, the interface doesn't provide the help function for a user to select pertinent search terms. To formulate a query at the present OPAC system, a user should learn a set of syntax different from system to system. All of above mentioned things make an end-user feel difficult to utilize an OPAC system effectively. This experimental system is attempted to alleviate a few limitations of the present OPAC system by a n.0, pplying the direct-manipulation technique as well as the feedback principle. First, this system makes it unnecessary for a user to learn some syntax for query formulation by providing option buttons for access points. Second, this system makes it possible for a user to decide whether each displayed record is relevant or not, and for keywords included in the relevant records to be automatically stored in order to be used for later feedback. Third, in this system, the keywords stored in [sayongja yongeu bogyanham] can be deleted if unnecessary or can selected as search terms for a query expansion as well as a query modification. Fourth, in this system, after inputting the original query, the feedback process can be proceed without coming back to the previous search step until a user becomes satisfied with the search results. In conclusion, the searching behaviors of heterogeneous users should be continuously observed, analysed, and studied, the findings of which should be integrated into the design for the interface of the OPAC system.

• The Journal of Society for e-Business Studies
• /
• v.13 no.4
• /
• pp.71-92
• /
• 2008

Currently, hotel search engines may help travelers find hotels, but the returned set of information is usually not satisfactory to them. It is because the engines do not understand what travelers want exactly and cannot deal with the travelers' interest which is expressed in various terms, even including some ambiguous ones. The objective of this research is to build hotel ontology using currently available semantic web technologies such as RDF, OWL and SWRL and to show how it can be used to help travelers find hotels of their interest. To that end, we analyzed available hotel-related ontologies and investigated typical terms which are used when searching for hotels in the Q&A communities. Based on the results of the analysis and investigation, we designed hotel domain ontology which consists of Objective Concepts Ontology(OCO), Universal Concepts Ontology(UCO), and Evaluation Concepts Ontology(ECO). To demonstrate the use of the ontology for a hotel search, we developed a Semantic Hotel Search System (SHSS).