• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.744-768
• /
• 2016

As various pieces of information can be provided through the web, schemes that provide search results optimized for individual users are required in consideration of user preference. Since the existing social search schemes use users' profiles, the accuracy of the search deteriorates. They also decrease the reliability of a search result because they do not consider a search time. Therefore, a new social search scheme that considers temporal information as well as popularities and user preferences is required. In this paper, we propose a new mobile social search scheme considering popularities and user preferences based on temporal information. Popularity is calculated by collecting the visiting records of users, while user preference is generated by the actual visiting information among the search results. In order to extract meaningful information from the search target objects that have multiple attributes, a skyline processing method is used, and rank is given to the search results by combining the user preference and the popularity with the skyline processing result. To show the superiority of the proposed scheme, we conduct performance evaluations of the existing scheme and the proposed scheme.

• Journal of Digital Convergence
• /
• v.13 no.12
• /
• pp.161-169
• /
• 2015

Realtime search words of typical portal sites appear every few seconds in descending order by search frequency in order to show issues increasing rapidly in interest. However, the characteristics of realtime search words reordering within too short a time cause problems that they go over the key issues of the day. This paper proposes a method for deriving a key issue through association analysis of realtime search words. The proposed method first makes scores of realtime search words depending on the ranking and the relative interest, and derives the top 10 search words through descriptive statistics for groups. Then, it extracts association rules depending on 'support' and 'confidence', and chooses the key issue based on the results as a graph visualizing them. The results of experiments show that the key issue through association rules is more meaningful than the first realtime search word.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.5A
• /
• pp.450-456
• /
• 2011

In this paper, idle channel search schemes based on spectrum sensing are proposed for cognitive radio systems with multiple channels. Specifically, we propose a scheme for determining the order of sensing for multiple channels, for which the probability of each channel being idle is estimated every search interval. By performing sensing in the descending order of the probabilities, the time required for searching idle channels is expected to decrease. In addition, we combine the proposed scheme with a user grouping scheme to further improve the sensing performance. Simulation results show that the user grouping reduces the search time, although it degrades the reliability of detection. The proposed search scheme based on probability estimation of channel idleness is found to reduce the search time significantly as compared to the conventional random search scheme. We apply both the proposed search scheme and user grouping scheme to a cognitive radio system to validate the overall performance.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.39-42
• /
• 2000

Motion estimation plays an important role for video coding. In this paper, we derive optimal search patterns for fast block matching motion estimation. By analyzing the block matching algorithm as a function of block shape and size, we can find an optimal search pattern for initial motion estimation. The proposed idea, which has been verified experimentally by computer simulations, can provide an analytical basis for the current MPEG-2 proposals. In order to choose a more compact search pattern for BMA, we exploit the statistical relationship between the motion and the frame difference of each block.

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

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

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

• The Journal of Korean Medicine Ophthalmology and Otolaryngology and Dermatology
• /
• v.13 no.1
• /
• pp.253-266
• /
• 2000

In order to strengthen objectivity and availability of oriental herb medicine, the standard formula for herbs has been attempted to set up by experimenting and documentary testing original herbs which were recorded in authorized document. The object herb medicine is Codonopsis Pilosulae Radix. The internal and external morphological standard in this study is expected to supply the search for several physiochemical reaction, biological reaction, determination of indicator material and identification of gene with basic sources in the future. The result of study is as follows; In the external shape, it was possible that herbs were distinguished according to artificial classification and that same genus-degree of relatedness among herbs could be distinguished by more precise and active observation. In the shape of real herbs, I compared current herbs in market with original herbs which were just collected or were on the course of drying. In addition, it was possible that the internal shape could be identified by using microscope after butanol series. In powder herbs, it was possible to purify the shape by microscope through maceration of natural and powder herbs. Though it was impossible to make distinction of herbs which are not current in my search contents, this search contents will be a standard for alpplying herbs in the future. Despite such a useful character, it was difficult to deal with power herbs because it was uncertain to make a standard for them on account of the crush of these tissue. Since powders shape of herbs in a few documents were regard not as the powder shapes of natural herbs but as the maceration state of them. It is suggested that we should inspect the original herbs which are not crushed yet with a microscope in order to identify crushed shape of powder herbs from now on. An Additional standard establishment including physiochemical reaction and gene research is required in order to supplement the fault of this search. As for the supplement about this search, considering that many kinds of same genus-degree of relatedness are being current now, it is necessary that each herb should he collected only after identifying and that the succeeding search of each herb should be proceeded for the regular establishment of internal and external standard.

• Journal of Internet Computing and Services
• /
• v.6 no.2
• /
• pp.99-115
• /
• 2005

Extensible Markup Language (XML) is an Internet standard that is used to express and convert data, In order to find the necessary information out of XML documents, you need a search system for XML documents, In this research, we have developed a search system that can find documents that matches the structure and content of a given XML document, making the best use of XML structure, Search metrics take account of the similarity in tag names, tag values, and the structure of tags, After a search, the system displays the ranked results in the order of aggregate similarity, Three methods of query are provided: keyword search which is conventional; search with tag names and their values; and search with XML documents, These three methods enable users to choose the method that best suits their preference, resulting in the increase of the usefulness of the system.