• Title/Summary/Keyword: search functions

Search Result 799, Processing Time 0.027 seconds

Evaluating and Comparing the Search & Discovery Features: Focusing on the Public Libraries OPACs and the Internet Bookstores (탐색과 디스커버리 기능 평가 연구 - 공공도서관 OPAC과 인터넷 서점을 중심으로 -)

  • Han, Seunghee
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.50 no.1
    • /
    • pp.493-511
    • /
    • 2016
  • Discovery is an emerging concept to enhance the search capabilities of library resources with the Next Generation Library Catalog. This paper defined the Discovery feature based on the information search behavior, and then derived the elements that make up its function. After that, the 11 regional representatives libraries' OPACs and 3 Internet bookstores are evaluated and compared against Search & Discovery capabilities. As a result, the Internet bookstores were superior to the libraries' OPACs for all the elements that make up the Discovery functions. This study verified that the public libraries OPACs are still concentrating on known item search, and it is hard for the users to meet a serendipity which is gained through the Discovery functions.

Mashup for Instant and Simple Search using OpenAPIs (OpenAPI를 이용하여 간결함과 즉시성을 가진 검색 매쉬업)

  • Hwang, Ki-Tae
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.2
    • /
    • pp.41-49
    • /
    • 2011
  • This paper introduces a new search model which can retrieve information instantly and easily about a given search word on Internet and control search spaces diversely. In the existing web searches, because the user has to stop his work, run web browsers, connect to special internet sites, and type the search word by keyboard. it is a long way and not a simple way. Also the search result is too much. The user suffers difficulties of multiple searches for different categories such as dictionary, image, video clips, etc. The software implemented in this paper enables for the user to select search word simply at any documents on the screen and make search started by simply pressing CRTL key and left button of the mouse simultaneously. The software is a mash up style using the Open API which is provided by a web site and can be freely available in any other sites. By calling different Open APIs of several web sites, the mash-up software can integrate search functions of many different sites. We evaluate that the software implemented in this paper will be a good reference of mash-up as one with characteristics of easy and instant search, simple result, diversity of search category, and scalability of search functions.

Design and Implementation of Wire/wireless Web Service System based on SOAP (SOAP 기반의 유/무선 웹 서비스 시스템 설계 및 구현)

  • Park Jong-Hoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.3
    • /
    • pp.661-668
    • /
    • 2005
  • This paper designs and implements wire/wireless web service system based on SOAP for price comparison dynamically using web service technoloies in real time. This web service system composes web service client module including functions of product search, product sort, product order and UDDI retrieval browser, and server module including functions of remote procedure call for product search/order and functions of UDDI publish browser, and mobile client module supporting functions for product search/order in wireless environments. This web service system can exchange product information based on SOAP messages and support independence of platform and flexible portability in environment conforming to SOAP, WSDL and UDDI standards.

Recent Development of Scoring Functions on Small Molecular Docking (소분자 도킹에서의 평가함수의 개발 동향)

  • Chung, Hwan Won;Cho, Seung Joo
    • Journal of Integrative Natural Science
    • /
    • v.3 no.1
    • /
    • pp.49-53
    • /
    • 2010
  • Molecular docking is a critical event which mostly forms Van der waals complex in molecular recognition. Since the majority of developed drugs are small molecules, docking them into proteins has been a prime concern in drug discovery community. Since the binding pose space is too vast to cover completely, many search algorithms such as genetic algorithm, Monte Carlo, simulated annealing, distance geometry have been developed. Proper evaluation of the quality of binding is an essential problem. Scoring functions derived from force fields handle the ligand binding prediction with the use of potential energies and sometimes in combination with solvation and entropy contributions. Knowledge-based scoring functions are based on atom pair potentials derived from structural databases. Forces and potentials are collected from known protein-ligand complexes to get a score for their binding affinities (e.g. PME). Empirical scoring functions are derived from training sets of protein-ligand complexes with determined affinity data. Because non of any single scoring function performs generally better than others, some other approaches have been tried. Although numerous scoring functions have been developed to locate the correct binding poses, it still remains a major hurdle to derive an accurate scoring function for general targets. Recently, consensus scoring functions and target specific scoring functions have been studied to overcome the current limitations.

Application of Adaptive Evolutionary Algorithm to Economic Load Dispatch with Nonconvex Cost Functions (NonConvex 비용함수를 가진 전력경제급전 문제에 적응진화 알고리즘의 적용)

  • Mun, Gyeong-Jun;Hwang, Gi-Hyeon;Park, Jun-Ho
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.50 no.11
    • /
    • pp.520-527
    • /
    • 2001
  • This paper suggests a new methodology of evolutionary computations - an Adaptive Evolutionary Algorithm (AEA) for solving the Economic Load Dispatch (ELD) problem which has piecewise quadratic cost functions and prohibited operating zones with many local minima. AEA uses a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner in order to take merits of two different evolutionary computations: global search capability of GA and local search capability of ES. In the reproduction procedure, proportions of the population by GA and the population by ES are adaptively modulated according to the fitness. Case studies illustrate the superiority of the proposed methods to existing conventional methods in power generation cost and computation time. The results demonstrate that the AEA can be applied successfully in the solution of ELD with piecewise quadratic cost functions and prohibited operating zones

  • PDF

Buyer Category-Based Intelligent e-Commerce Meta-Search Engine (구매자 카테고리 기반 지능형 e-Commerce 메타 서치 엔진)

  • Kim, Kyung-Pil;Woo, Sang-Hoon;Kim, Chang-Ouk
    • IE interfaces
    • /
    • v.19 no.3
    • /
    • pp.225-235
    • /
    • 2006
  • In this paper, we propose an intelligent e-commerce meta-search engine which integrates distributed e-commerce sites and provides a unified search to the sites. The meta-search engine performs the following functions: (1) the user is able to create a category-based user query, (2) by using the WordNet, the query is semantically refined for increasing search accuracy, and (3) the meta-search engine recommends an e-commerce site which has the closest product information to the user’s search intention by matching the user query with the product catalogs in the e-commerce sites linked to the meta-search engine. An experiment shows that the performance of our model is better than that of general keyword-based search.

User Category-Based Intelligent e-Commerce Meta-Search Engine

  • U, Sang-Hun;Kim, Gyeong-Pil;Kim, Chang-Uk
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2005.11a
    • /
    • pp.346-355
    • /
    • 2005
  • In this paper, we propose a meta-search engine which provides distributed product information through a unified access to multiple e-commerce. The meta-search engine proposed in this paper performs the following functions: (I) The user is able to create a category-based user query, (2) by using the WordNet, the query is semantical refined fined for increasing search accuracy, and (3) the meta-search engine recommends an e-commerce site which has the closest product information to the user's search intention, by matching the user query with the product catalogs in the e-commerce sites linked to the meta-search engine. An experiment shows that the performance of our model is better than that of general keyword-based search.

  • PDF

GLOBAL CONVERGENCE OF A NEW SPECTRAL PRP CONJUGATE GRADIENT METHOD

  • Liu, Jinkui
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.5_6
    • /
    • pp.1303-1309
    • /
    • 2011
  • Based on the PRP method, a new spectral PRP conjugate gradient method has been proposed to solve general unconstrained optimization problems which produce sufficient descent search direction at every iteration without any line search. Under the Wolfe line search, we prove the global convergence of the new method for general nonconvex functions. The numerical results show that the new method is efficient for the given test problems.

Design of Optimal Fuzzy Logic based PI Controller using Multiple Tabu Search Algorithm for Load Frequency Control

  • Pothiya Saravuth;Ngamroo Issarachai;Runggeratigul Suwan;Tantaswadi Prinya
    • International Journal of Control, Automation, and Systems
    • /
    • v.4 no.2
    • /
    • pp.155-164
    • /
    • 2006
  • This paper focuses on a new optimization technique of a fuzzy logic based proportional integral (FLPI) load frequency controller by the multiple tabu search (MTS) algorithm. Conventionally, the membership functions and control rules of fuzzy logic control are obtained by trial and error method or experiences of designers. To overcome this problem, the MTS algorithm is proposed to simultaneously tune proportional integral gains, the membership functions and control rules of a FLPI load frequency controller in order to minimize the frequency deviations of the interconnected power system against load disturbances. The MTS algorithm introduces additional techniques for improvement of the search process such as initialization, adaptive search, multiple searches, crossover and restart process. Simulation results explicitly show that the performance of the proposed FLPI controller is superior to conventional PI and FLPI controllers in terms of overshoot and settling time. Furthermore, the robustness of the proposed FLPI controller under variation of system parameters and load change are higher than that of conventional PI and FLPI controllers.

The Development of Two-Person Janggi Board Game Using Backpropagation Neural Network and Reinforcement Learning (역전파 신경회로망과 강화학습을 이용한 2인용 장기보드게임 개발)

  • Park, In-Kue;Jung, Kwang-Ho
    • Journal of Korea Game Society
    • /
    • v.1 no.1
    • /
    • pp.61-67
    • /
    • 2001
  • This paper describes a program which learns good strategies for two-poison, deterministic, zero-sum board games of perfect information. The program learns by simply playing the game against either a human or computer opponent. The results of the program's teaming of a lot of games are reported. The program consists of search kernel and a move generator module. Only the move generator is modified to reflect the rules of the game to be played. The kernel uses a temporal difference procedure combined with a backpropagation neural network to team good evaluation functions for the game being played. Central to the performance of the program is the search procedure. This is a the capture tree search used in most successful janggi playing programs. It is based on the idea of using search to correct errors in evaluations of positions. This procedure is described, analyzed, tested, and implemented in the game-teaming program. Both the test results and the performance of the program confirm the results of the analysis which indicate that search improves game playing performance for sufficiently accurate evaluation functions.

  • PDF