• Journal of the Korean Society for information Management
• /
• v.29 no.1
• /
• pp.175-190
• /
• 2012

This study aims to investigate the current status of mobile search functions of Korean search portals, namely Google Korea, Naver, Nate, Daum, and Yahoo Korea. This study focuses on unique mobile search functionalities, such as voice search, music search, code search, and visual/ object search. In particular, this study analyzed characteristics of these search functions and evaluated their performances based on the accuracy and the speed of recognition. The results of this study show that both Naver and Daum support various mobile searching functions, whereas Google only supports voice search. Nate and Yahoo do not offer any unique function. The results of this study can be applied to the portal's effective development of mobile search functionalities.

• Journal of the Korean Society for Library and Information Science
• /
• v.47 no.4
• /
• pp.5-23
• /
• 2013

The purpose of this study is to examine the functions and features of SearchWorks developed as the Next Generation Library Catalog by Stanford University Libraries. It was designed to fully represent the needs and search behaviors of users, with Blacklight, an open source software. Its main features are not different from those standard functions supplied by other commercial packages of Next Generation Library Catalogs, and its continuing improvement and changes, including the addition and expansion of more useful functions and the removal of unnecessary ones, have been observed since the introduction of a beta version in 2010.

• Journal of Korean Library and Information Science Society
• /
• v.42 no.2
• /
• pp.257-276
• /
• 2011

The purpose of this study is to compare and analyze the functions and characteristics of search interfaces of Korean Old and Rare Collection Information System(KORCIS) and Korean History Online. The checklist of OPAC functionalities proposed by Breeding was used to examine eleven functions of these systems. Both system provide the following functions: Search by keywords; Boolean operators in queries; Order results chronologically; Modify search without re-keying the initial terms ; Search within result sets ; and Ability to limit results to an individual library or education. They do not provide such functions as Browse by author, title, subject and View and recall the search history for the current session. Adoption of standard OPAC and next-generation catalog functionalities, in-depth understanding of user needs and information seeking behaviors, and the improvement of subject access to these systems are suggested in this study.

• Journal of the Korean Society for information Management
• /
• v.14 no.2
• /
• pp.269-284
• /
• 1997

Internet is a world wide telecommunication netweok that is used broadly in every fields through the multimedia services offered by using Web Browser. The purpose of this study is to examine the functions of search tools. It analyzes that search tools have various characteristics and functions and Internet users have to select appropriate search tools for their information needs. Also improvement and development for search tools have to be continued.

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

• Journal of Information Processing Systems
• /
• v.16 no.2
• /
• pp.478-493
• /
• 2020

We designed a new meta-heuristic algorithm named Photon Search Algorithm (PSA) in this paper, which is motivated by photon properties in the field of physics. The physical knowledge involved in this paper includes three main concepts: Principle of Constancy of Light Velocity, Uncertainty Principle and Pauli Exclusion Principle. Based on these physical knowledges, we developed mathematical formulations and models of the proposed algorithm. Moreover, in order to confirm the convergence capability of the algorithm proposed, we compared it with 7 unimodal benchmark functions and 23 multimodal benchmark functions. Experimental results indicate that PSA has better global convergence and higher searching efficiency. Although the performance of the algorithm in solving the optimal solution of certain functions is slightly inferior to that of the existing heuristic algorithm, it is better than the existing algorithm in solving most functions. On balance, PSA has relatively better convergence performance than the existing metaheuristic algorithms.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2001.04a
• /
• pp.223-232
• /
• 2001

This paper describes Genetic Algorithm-Based Relay Search Method, RS-GA, which is developed in this study to search the multiple design variables in the design space. The RS-GA based on Simple-GA consists of some functions to search many variables from some wide variable space. It repeats a Simple-GA, that is the convergence process of the Simple-GA, which makes many time reiteration itself. From the results of the numerical studies, it was actually found that RS-GA can search all peak-variable from the 2D functions including 5 peaks. Finally, RS-GA applied for design-strengthening problems in composite plate girder bridges using the external prestressing technique is also verified.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.488-491
• /
• 1995

The paper presents a new global maximum search method for multimodal unknown functions of two variables. The search method is composed of two stages and sequentially samples the candidate point in a subdomain selected using a priority function in each stage. The search domain is auto-similarly divided into triangular subdomains, or cells, during the search process. A measure of accuracy of local maximum search is introduced to check if a local search has converged to a specified accuracy or the maximum of a local peak cannot be the global maximum. A criterion for switching from the first to the second stage, is proposed using a ratio of the observed peak width to the largest cell in the domain. By numerical simulations, the required number of trials is evaluated for some function models with different peak parameters, and the switching criterion is optimally determined. The results show that the proposed method obtains global maximum points with certainty and saves largely computation time even for functions with extremely steep peaks.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.50 no.11
• /
• pp.532-540
• /
• 2001

In this paper, we propose a probabilistic tabu search strategy for function optimization. It is composed of two procedures, one is Basic search procedure that plays a role in local search, and the other is Restarting procedure that enables to diversify search region. In basic search procedure, we use Belief space and Near region to create neighbors. Belief space is made of high-rank neighbors to effectively restrict searching space, so it can improve searching time and local or global searching capability. When a solution is converged in a local area, Restarting procedure works to search other regions. In this time, we use Probabilistic Tabu Strategy(PTS) to adjust parameters such as a reducing rate, initial searching region etc., which makes enhance the performance of searching ability in various problems. In order to show the usefulness of the proposed method, the PTS is applied to the minimization problems such as De Jong functions, Ackley function, and Griewank functions etc., the results are compared with those of GA or EP.

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10b
• /
• pp.772-776
• /
• 1988

In quantized control systems, the control values can take only given discrete (e.g. integer) values. In case of dealing with the control problem on the discrete-time, final-stage fixed, quantized control systems with multidimensional performance functions, the first thing, new definition on noninferior solutions in these systems is necessary because of their discreteness in state variables, and the efficient search for those solutions at final-stage is unavoidable for seeking their discrete-time optimal controls to these systems. In this paper, to the quantized control problem given by the formulation of Halkin-typed linear control systems with two performance functions, a new definition on noninferior solutions of this system control problem and a heuristic effective search on these noninferior solutions are stated. By use of these concepts, two definitions on noninferior solutions and the algorithm consisted of 8 steps and attained by geometric approaches are given. And a numerical example using the present algorithm is shown.