• Title/Summary/Keyword: search result

Search Result 2,585, Processing Time 0.027 seconds

A Study on Next Generation OPAC's Interface and Function (차세대 OPAC의 인터페이스와 기능에 관한 연구)

  • Gu, Jung-Eok;Kwak, Seung-Jin
    • Journal of the Korean BIBLIA Society for library and Information Science
    • /
    • v.18 no.2
    • /
    • pp.61-88
    • /
    • 2007
  • The purpose of this study is to provide an actual basic data and helps for arranging the next generation OPAC's interface and function through improving the existing OPAC's interface and improvement in the domestic library. In this study, factors to be importantly considered for improving the OPAC's interface and function were examined based on the preceding studies on OPAC concept & development process, user's library use style, user use style of OPAC, and recognition on library's crisis, and actual condition investigation result. Also, the case analysis on the existing OPAC's interface and function was focused on the search window, search item, search method, alignment function, search result display and search result feedback. Also, the search interface and search function of the next generation OPAC which is provided by the recently-developed domestic and foreign library utilization, and the detailed case were analyzed in the aspect of Library 2.0 service. Finally, the measures for improving the existing OPAC's interface and function in domestic library were suggested.

A Study on the Features of the Next Generation Search Services (차세대 검색서비스의 속성에 관한 연구)

  • Lee, Soo-Sang;Lee, Soon-Young
    • Journal of the Korean Society for information Management
    • /
    • v.26 no.4
    • /
    • pp.93-112
    • /
    • 2009
  • Recently in the area of the information environment, there are lively discussions about search 2.0 which is representative of the next generation search services. In this study, we divide information search model into matching and linking models according the developmental stages. Therefore, on the one hand, we analyze the background, main concepts, related attributes and cases of the next generation search services and the other, we identify the representative keywords by the group analysis of various attributes and cases of it. The result shows that the main keywords such as social search, artificial intelligence and semantic search, and relation/network based search are representative of the search 2.0.

A Study on Online Consumers′Price Sensitivity (온라인 시장에서 가격민감도에 영향을 미치는 요인에 관한 연구)

  • 송형철
    • The Journal of the Korea Contents Association
    • /
    • v.2 no.3
    • /
    • pp.59-69
    • /
    • 2002
  • This article purpose are on the variables of consumer's Doe sensitivity. Our result from sets of data indicate that the web site trust, the web site interactivity and the perceived risk have an effect on price search. Our result is as follows. First, the more trust the web site, the lower the price search. Second, the more interactivity of the web site, the lower the price search. Third, the greater the depth of information at the web site, the higher the price search. forth, the higher the perceived risk, the higher the price search. Fifth, the higher the knowledge of product, the higher the price search.

  • PDF

Reinterpretation of the protein identification process for proteomics data

  • Kwon, Kyung-Hoon;Lee, Sang-Kwang;Cho, Kun;Park, Gun-Wook;Kang, Byeong-Soo;Park, Young-Mok
    • Interdisciplinary Bio Central
    • /
    • v.1 no.3
    • /
    • pp.9.1-9.6
    • /
    • 2009
  • Introduction: In the mass spectrometry-based proteomics, biological samples are analyzed to identify proteins by mass spectrometer and database search. Database search is the process to select the best matches to the experimental mass spectra among the amino acid sequence database and we identify the protein as the matched sequence. The match score is defined to find the matches from the database and declare the highest scored hit as the most probable protein. According to the score definition, search result varies. In this study, the difference among search results of different search engines or different databases was investigated, in order to suggest a better way to identify more proteins with higher reliability. Materials and Methods: The protein extract of human mesenchymal stem cell was separated by several bands by one-dimensional electrophorysis. One-dimensional gel was excised one by one, digested by trypsin and analyzed by a mass spectrometer, FT LTQ. The tandem mass (MS/MS) spectra of peptide ions were applied to the database search of X!Tandem, Mascot and Sequest search engines with IPI human database and SwissProt database. The search result was filtered by several threshold probability values of the Trans-Proteomic Pipeline (TPP) of the Institute for Systems Biology. The analysis of the output which was generated from TPP was performed. Results and Discussion: For each MS/MS spectrum, the peptide sequences which were identified from different conditions such as search engines, threshold probability, and sequence database were compared. The main difference of peptide identification at high threshold probability was caused by not the difference of sequence database but the difference of the score. As the threshold probability decreases, the missed peptides appeared. Conversely, in the extremely high threshold level, we missed many true assignments. Conclusion and Prospects: The different identification result of the search engines was mainly caused by the different scoring algorithms. Usually in proteomics high-scored peptides are selected and low-scored peptides are discarded. Many of them are true negatives. By integrating the search results from different parameter and different search engines, the protein identification process can be improved.

Configurations of Knowledge Search in Knowledge-Intensive Industries (지식기반산업에서 기업의 지식탐색 유형: 구성형태적 접근)

  • Huh, Moon-Goo;Lee, Jaegun
    • Journal of Technology Innovation
    • /
    • v.25 no.3
    • /
    • pp.299-331
    • /
    • 2017
  • This research details firm knowledge search types based on the locus and features for Korean firms in the knowledge-based industry, and then analyzes differences in innovation performance according to the types from the view of a configurational approach. Existing research has mainly concentrated on establishing a relation between knowledge search and outcome variables. Consequently, firms have relatively insufficient understanding of how to systematize knowledge search. Hence, this research classifies knowledge search into four dimensions-external search breadth, external search depth, internal search breadth, and internal search depth-by the locus and features of search. Furthermore, the research draws actual types of knowledge search of firms and analyzes differences in innovation performance. The main result of the research is as follows. First, the research reasons out six clusters of firms which have a dissimilar knowledge search type. Each cluster shows differences while participating in every dimension of knowledge search or few dimensions. Second, as for innovation performance, each cluster shows different exploitative and exploratory innovation performance according to their knowledge search type. This research applies a configurational approach while existing research applied a reductionistic approach, thereby establishing the major contribution which enables us to study a phenomenon as it comes, not to analyze variables and relationships of variables. Lastly, the research suggests a future direction of research based on the result of this research.

An Improvement Video Search Method for VP-Tree by using a Trigonometric Inequality

  • Lee, Samuel Sangkon;Shishibori, Masami;Han, Chia Y.
    • Journal of Information Processing Systems
    • /
    • v.9 no.2
    • /
    • pp.315-332
    • /
    • 2013
  • This paper presents an approach for improving the use of VP-tree in video indexing and searching. A vantage-point tree or VP-tree is one of the metric space-based indexing methods used in multimedia database searches and data retrieval. Instead of relying on the Euclidean distance as a measure of search space, the proposed approach focuses on the trigonometric inequality for compressing the search range, which thus, improves the search performance. A test result of using 10,000 video files shows that this method reduced the search time by 5-12%, as compared to the existing method that uses the AESA algorithm.

A study on the efficient patent search process using big data analysis tool R (빅데이터 분석 도구 R을 활용한 효율적인 특허 검색에 관한 연구)

  • Zhang, Jing-Lun;Jang, Jung-Hwan;Kim, Suk-Ju;Lee, Hyun-Keun;Lee, Chang-Ho
    • Journal of the Korea Safety Management & Science
    • /
    • v.15 no.4
    • /
    • pp.289-294
    • /
    • 2013
  • Due to sudden transition to intellectual society corresponding with fast technology progress, companies and nations need to focus on development and guarantee of intellectual property. The possession of intellectual property has been the important factor of competition power. In this paper we developed the efficient patent search process with big data analysis tool R. This patent search process consists of 5 steps. We result that at first this process obtain the core patent search key words and search the target patents through search formula using the combination of above patent search key words.

Excluding Technique Design for Duplicated Results of Search (검색엔진의 중복된 검색결과 배제 기법설계)

  • Lee Seo-Jeong
    • Journal of Digital Contents Society
    • /
    • v.2 no.2
    • /
    • pp.139-145
    • /
    • 2001
  • As e-commerce has been activated and internet has been used as usual, higher efficient search engine must be used to promote the value of information and take possession of the market place. all e-commerce user seller and buyer want to competitive goods Although these needs, search results are still much to be desired. In this paper, I will suppose two ideas which are abbreviation result and making blacklist. Abbreviation result is to hide results with common factors and making blacklist is to reduce null links of search results, which makes many useless results. This routine is made of making blacklist, check list, reduce list and append list.

  • PDF

A Restructuring Method for Search Results of SNOMED CT Browser (SNOMED CT 브라우저에서 검색 결과의 재구성 기법)

  • Ryu, Wooseok
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.10 no.3
    • /
    • pp.165-170
    • /
    • 2015
  • SNOMED CT browser is a browsing tool for searching clinical terms in SNOMED CT which is a standard terminology set used worldwide. The search result view of previous browsers merely list up candidate terminologies. The problem is that most of users become confused about how to select an appropriate term from the list. This leads serious waste of medical recoding cost. This paper discusses characteristics of SNOMED CT dataset and proposes a novel design of enhanced result view by restructuring the results using relationships of SNOMED CT concepts. Using the proposed scheme, medical doctors or officers can select appropriate terms more efficiently and can reduce overall recording time.

Design of ferromagnetic shims for an HTS NMR magnet using sequential search method

  • Yang, Hongmin;Lee, SangGap;Ahn, Minchul
    • Progress in Superconductivity and Cryogenics
    • /
    • v.23 no.4
    • /
    • pp.39-43
    • /
    • 2021
  • This study deals with the ferromagnetic shims design based on the spherical harmonic coefficient reduction method. The design method using the sequential search method is an intuitive method and has the advantage of quickly reaching the optimal result. The study was conducted for a 400 MHz all-REBCO magnet, which had difficulty in shimming due to the problem of SCF (screening current induced field). The initial field homogeneity of the magnet was measured to be 233.76 ppm at 20 mm DSV (Diameter Spherical Volume). In order to improve the field homogeneity of the magnet, the ferromagnetic shim with a thickness of 1 mil to 11 mil was constructed by a design method in which sequential search algorithm was applied. As a result, the field homogeneity of the magnet could be significantly improved to 0.24 ppm at 20 mm DSV and 0.05 ppm at 10 mm DSV.