• Journal of Korean Library and Information Science Society
• /
• v.42 no.1
• /
• pp.397-415
• /
• 2011

Google, an internet search service with extensive user base, has provided Book Search service. Google has pursued collaboration with publishers and libraries to obtain content for Book Search service; publisher community for the purpose of sourcing the books with copyrights, and the libraries for the purpose of digitizing their collections and also utilizing already digitized resources. Google Book Search Service has evoked significant controversy because of the potential monopoly problems and its risk, accompanied by Google's huge influence and broad user spectrum. This study, thus, suggests the countermeasures that library community should prepare in order to cope with the Google Book Search.

• Journal of the Korean Society for information Management
• /
• v.26 no.3
• /
• pp.111-129
• /
• 2009

This study examined the usability of text-based search and visual search of a large multidisciplinary library database to provide an empirical analysis of the acceptability of visual systems in the information retrieval environment. It also examined if there are differences in the usability assessment based on experimental order. The results indicated that the text-based search supported users' search behaviors more efficiently than the visual search. Also the text-based search was rated higher than the visual search in terms of user perceptions of four usability factors.

• Journal of Korean Library and Information Science Society
• /
• v.39 no.1
• /
• pp.265-278
• /
• 2008

This study aims to perform an evaluation of unified search services provided by major Korean search portals, Naver, Daum, Yahoo-Korea, and Empas. These unified search services are evaluated in terms of the relevance of search results. In conducting this study, real queries that real users submitted were used. This study also utilized click logs that consist of documents users clicked and viewed. The results of this study can be implemented to the development and improvement of portal's unified search services. Users can refer to the results of this study in choosing unified search services from search portals.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.129-138
• /
• 2006

Various techniques have been applied to solve the maximal covering problem. Tabu search is also one of them. But, existing researches were lacking of the synthetic analysis and the effort for performance improvement about neighborhood search techniques such as hill-climbing search and simulated annealing including tabu search. In this paper, I introduce the way to improve performance of neighborhood search techniques through various experiments and analyses. Basically, all neighborhood search algorithms use the k-exchange neighborhood generation method. And I analyzed how the performance of each algorithm changes according to various parameter settings. Experimental results have shown that simple hill-climbing search and simulated annealing can produce better results than any other techniques. And I confirmed that simple hill-climbing search can produce similar results as simulated annealing unlike general case.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.10a
• /
• pp.13-16
• /
• 2004

This paper deals with a one-searcher multi-target search problem where targets with different detection priorities move in Markov processes in each discrete time over a given space search area, and the total number of search time intervals is fixed. A limited search resource is available in each search time interval and an exponential detection function is assumed. The searcher can obtain a target detection award, if detected, which represents the detection priority of target and is non-increasing with time. The objective is to establish the optimal search plan which allocates the search resource effort over the search areas in each time interval in order to maximize the total detection award. In the analysis, the given problem is decomposed into intervalwise individual search problems each being treated as a single stationary target problem for each time interval. An associated iterative procedure is derived to solve a sequence of stationary target problems. The computational results show that the proposed algorithm guarantees optimality.

• Korean Journal of Oriental Medicine
• /
• v.17 no.2
• /
• pp.57-62
• /
• 2011

We in this paper propose a semantic search system using the basic ontology in Korean medicine field. The basic ontology provides a formalization of medicinal materials, formulas, and diseases of Korean medicine. Recently, many studies for the semantic search system have been proposed. However, they do not support the semantic search and reasoning in the domain of Korean medicine because they do not have the Korean medicine ontology. Our system provides the semantic search features of semantic keyword recommendation, associated information browsing, and ontology reasoning based on the basic ontology. In addition, they also have the features of ontology search of a form of table and graph, synonym search, and external Open API supports. The general search engines usually provide search results for the simple keyword, while our system can also provide the associated information with respect to search results by using ontology so that can recommend more exact results to users.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.5171-5189
• /
• 2016

With the popularity of cloud computing, many data owners outsource their graph data to the cloud for cost savings. The cloud server is not fully trusted and always wants to learn the owners' contents. To protect the information hiding, the graph data have to be encrypted before outsourcing to the cloud. The adjacent vertex search is a very common operation, many other operations can be built based on the adjacent vertex search. A boolean adjacent vertex search is an important basic operation, a query user can get the boolean search results. Due to the graph data being encrypted on the cloud server, a boolean adjacent vertex search is a quite difficult task. In this paper, we propose a solution to perform the boolean adjacent vertex search over encrypted graph data in cloud computing (BASG), which maintains the query tokens and search results privacy. We use the Gram-Schmidt algorithm and achieve the boolean expression search in our paper. We formally analyze the security of our scheme, and the query user can handily get the boolean search results by this scheme. The experiment results with a real graph data set demonstrate the efficiency of our scheme.

• The Journal of Industrial Distribution & Business
• /
• v.12 no.1
• /
• pp.7-13
• /
• 2021

Purpose: Unemployment in its general form is a result stemming from the decisions of workers to search for a new and better paying job. In this study, the view that unemployed workers were not simply desiring any job, but one that would maximize their expected future outcome, was examined. Research design, data, and methodology: In order for collection of data and analysis, the panel dates of individual applications for job openings on job search websites were utilized to examine search effort and period for individuals. Results: It was found that the number of applications sent by a job seeker declined over their period of job searching, and that job seekers over a long duration of time tend to send relatively more applications per week throughout their entire search period. The latter finding contradicts the implications of the standard labor search effort models. Conclusions: It can be observed that these job search models fail to capture several key elements in search efforts, and that the search time for an offer is not entirely predetermined by the labor market conditions and socio-economic (individual) characteristics of the searcher. It can be shortened as he or she intensifies their job search efforts.

• Korean small business review
• /
• v.41 no.2
• /
• pp.1-24
• /
• 2019

This paper seeks to explore the effects of search strategies on innovation performance in the context of small and medium enterprises. The empirical results of 3,398 Korean SMEs demonstrate that there is a substitutive relationship between search depth and search width, and this substitutive relationship is weakened when a firm possesses collaboration experience. Furthermore, although these two types of search enhance innovation performance, the impact of search depth is greater than that of search width. The positive effect of search width on innovation performance is weakened when the firm adopts formal information protection mechanisms.

• The Korean Journal of Food & Health Convergence
• /
• v.10 no.2
• /
• pp.27-36
• /
• 2024

This study aims to investigate whether information awareness, search purpose, and search expectations influence information avoidance among university students. The data were collected by using a self-completion questionnaire with convenience sampling of students from one university. The collected data were analyzed by descriptive statistics, t-test, analysis of variance (ANOVA), Pearson's correlation coefficient, and multiple regression using R 4.2.3. The main results are as follows: First, both search purpose and search expectations exhibited a significant inverse correlation with all information avoidance dependent variables. Second, there was a significant difference in the mean of search expectations across majors, such that science majors had higher search expectations than humanities majors. Third, there were significant differences in the means of the information avoidance-system and information avoidance variables by major, such that both variables had lower means for the science than the humanities group. Fourth, among the independent variables, search expectation had a significant effect on information avoidance-personal: the higher the search expectation variable, the lower the information avoidance-personal variable. This study confirmed that information avoidance should not only consider the psychological, emotional, and affective aspects of information seekers, but also that information seekers' information search purpose and search expectations are predictors of information avoidance.