• Title/Summary/Keyword: Database Searching

Search Result 534, Processing Time 0.032 seconds

A Protein Structure Comparison System based on PSAML (PSAML을 이용한 단백질 구조 비고 시스템)

  • Kim Jin-Hong;Ahn Geon-Tae;Byun Sang-Hee;Lee Su-Hyun;Lee Myung-Joon
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.11 no.2
    • /
    • pp.133-148
    • /
    • 2005
  • Since understanding of similarities and differences among protein structures is very important for the study of the relationship between structure and function, many protein structure comparison systems have been developed. Hut, unfortunately, these systems introduce their own protein data derived from the PDB(Protein Data Bank), which are needed in their algorithms for comparing protein structures. In addition, according to the rapid increase in the size of PDB, these systems require much more computation to search for common substructures in their databases. In this paper, we introduce a protein structure comparison system named WS4E(A Web-Based Searching Substructures of Secondary Structure Elements) based on a PSAML database which stores PSAML documents using the eXist open XML DBMS. PSAML(Protein Structure Abstraction Markup Language) is an XML representation of protein data, describing a protein structure as the secondary structures of the protein and their relationships. Using the PSAML database, the WS4E provides web services searching for common substructures among proteins represented in PSAML. In addition, to reduce the number of candidate protein structures to be compared in the PSAML database, we used topology strings which contain the spatial information of secondary structures in a protein.

Efficient Management System Implementation for FSTA Database based on KRISTAL (KRISTAL기반의 FSTA 구축을 위한 효율적인 관리 시스템 구현)

  • Yoon, Hee-Jun;Lee, Seok-Hyoung;Yoon, Hwa-Mook;Kim, Han-Gi
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2006.05a
    • /
    • pp.495-498
    • /
    • 2006
  • Domestic information service authority and company provide database services to introduce the newest scientific and technological information, trend, and research data. Among many databases, FSTA((Food Science and Technology Abstracts)) is a bibliographic database providing worldwide coverage of all scientific and technological aspects of the processing and manufacturing of human food products. To service FSTA database through KRISTAL search engine developed by KISTI(Korea Institute of Science and Technology Information) need many process such as data obtainment, building, search, modification, rebuilding, and statistics. In this paper, we present implementation of management tool used to build FSTA database effectively. The management tool provides graphical user interface and controls all process from data obtainment to building of KRISTAL information searching system. By building FSTA database fast and accurately, user can get information that they want to find from the newest FSTA database.

  • PDF

Delay Operation Techniques for Efficient MR-Tree on Nand Flash Memory (낸드 플래시 메모리 상에서 효율적인 MR-트리 동작을 위한 지연 연산 기법)

  • Lee, Hyun-Seung;Song, Ha-Yoon;Kim, Kyung-Chang
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.8
    • /
    • pp.758-762
    • /
    • 2008
  • Embedded systems usually utilize Flash Memories with very nice characteristics of non-volatility, low access time, low power and so on. For the multimedia database systems, R-tree is an indexing tree with nice characteristics for multimedia access. MR-tree, which is an upgraded version of R-tree, has shown better performance in searching, inserting and deleting operations than R-tree. Flash memory has sectors and blocks as a unit of read, write and delete operations. Especially, the delete is done on a unit of 512 byte blocks with very large operation time and it is also known that read and write operations on a unit of block matches caching nature of MT-tree. Our research optimizes MR-tree operations in a unit of Flash memory blocks. Such an adjusting leads in better indexing performance in database accesses. With MR-tree on a 512B block units we achieved fast search time of database indexing with low height of MR-tree as well as faster update time of database indexing with the best fit of flash memory blocks. Thus MR-tree with optimized operations shows good characteristics to be a database index schemes on any systems with flash memory.

Establishing a Energy Utilization Database for Energy Performance Evaluation of Multi-Family Housing using District Heating (지역난방 공동주택의 에너지 성능 평가를 위한 공동주택 단지별 에너지사용량 Database 구축)

  • Jeong, Jaewook;Hong, Taehoon;Ji, Changyoon;Leigh, Seung-Bok
    • Korean Journal of Construction Engineering and Management
    • /
    • v.16 no.5
    • /
    • pp.105-113
    • /
    • 2015
  • In order to evaluate the energy performance of buildings, it is important to determine reliable information of energy utilization during operating phase. It is also required to establish the database which have the amounts of population deducted by objective filtering and analysis. In this study, all energy sources were applied to evaluate synthetically the energy performance of Multi-Family Housings(MFH) using district heating and the amounts of population were obtained sufficiently through data searching in Seoul and neighbor cities. Finally the database of source energy utilization and $CO_2$ emission in 325 MFH complexes were established through cross validation between data sources and statistical analysis. Additionally, further ideas have been proposed to improve existing MFH Management Information System.

A Generation of Digital Elevation Model for GSIS using SPOT Satellite Imagery (GSIS의 자료기반 구축을 위한 SPOT 위성영상으로부터의 수치표고모형 생성)

  • Yeu, Bock-Mo;Park, Hong-Gi;Jeong, Soo;Kim, Won-Dae
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.1 no.1 s.1
    • /
    • pp.141-152
    • /
    • 1993
  • This study aims to generate digital elevation model from digital satellite imagery. Digital elevation model is being increasingly used for geo-spatial information system database development and for digital map production. Image matching technique was applied to acquire conjugate image coordinates and the algorithm for digital elevation model generation is presented in this study The exterior orientation parameters of the satellite imagery is determined by bundle adjustment and standard correlation was applied for image matching conjugate of image points. The window as well as the searching area have to be defined in image matching. Different sizes of searching area were tested to study the appropriate size of the searching area. Various coordinate transformation methods were applied to improve the computation speed as well as the geometric accuracy. The results were then statistically analysed after which the searching area is determined with the safety factor. To evaluate the accuracy of digital elevation model, 3-D coordinates were extracted from 1/5000 scale topographic map and this was compared to the digital elevation model generated from satellite imagery. The algorithm for generation of digital elevation model generated from satellite imagery is presented in this study which will prove effective in the database development of geo-spatial information system and in digital elevation modelling of large areas.

  • PDF

An Analysis of Physicians' Online Information Search Process at the Point of Care (의사의 임상질문 해결을 위한 온라인 정보검색과정 연구)

  • Kim, Soon;Chung, EunKyung
    • Journal of the Korean Society for information Management
    • /
    • v.33 no.3
    • /
    • pp.177-193
    • /
    • 2016
  • This study aims to analyze physicians' online information search process to solve the clinical questions at the point of care. To achieve this purpose, ten university hospital-based physicians participated in-depth interviews and observation studies. Based on Wilson's problem solving process, this study analyzed the characteristics of each information search stage and efficiency of online searching. The results showed that participants tend to relatively immediately formulate their clinical questions. However, basic searching strategies were only used and a few preferred information sources were chosen. However, average satisfaction degree of online searching appeared high with 5.7 (7 Likert-scale) and problem-solving index increased after searching. As physicians are likely to use well organized and evidenced-based credible information easily, it implies the needs for an integrated search system within the electronic medical record (EMR). In addition, as other online resources' awareness is lower comparing Google and PubMed, active promotions and training of other resources are needed.

A Partition Mining Method of Sequential Patterns using Suffix Checking (서픽스 검사를 이용한 단계적 순차패턴 분할 탐사 방법)

  • 허용도;조동영;박두순
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.5
    • /
    • pp.590-598
    • /
    • 2002
  • For efficient sequential pattern mining, we need to reduce the cost to generate candidate patterns and searching space for the generated ones. Although Apriori-like methods like GSP[8] are simple, they have some problems such as generating of many candidate patterns and repetitive searching of a large database. PrefixSpan[2], which was proposed as an alternative of GSP, constructs the prefix projected databases which are stepwise partitioned in the mining process. It can reduce the searching space to estimate the support of candidate patterns, but the construction cost of projected databases is still high. To solve these problems, we proposed SuffixSpan(Suffix checked Sequential Pattern mining) as a new sequential pattern mining method. It generates a small size of candidate pattern sets using partition property and suffix property at a low cost and also uses 1-prefix projected databases as the searching space in order to reduce the cost of estimating the support of candidate patterns.

  • PDF

A three-step sentence searching method for implementing a chatting system (채팅 시스템 구현을 위한 3단계 문장 검색 방법)

  • Jeon, Won-Pyo;Song, Yoeng-Kil;Kim, Hark-Soo
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.37 no.2
    • /
    • pp.205-212
    • /
    • 2013
  • The previous chatting systems have generally used methods based on lexical agreement between users' input sentences and target sentences in a database. However, these methods often raise well-known lexical disagreement problems. To resolve some of lexical disagreement problems, we propose a three-step sentence searching method that is sequentially applied when the previous step is failed. The first step is to compare common keyword sequences between users' inputs and target sentences in the lexical level. The second step is to compare sentence types and semantic markers between users' input and target sentences in the semantic level. The last step is to match users's inputs against predefined lexico-syntactic patterns. In the experiments, the proposed method showed better response precision and user satisfaction rate than simple keyword matching methods.

PAS: Personalized Research Agent System using Modified Spreading Neural Network

  • Cho, Young-Im
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.146.1-146
    • /
    • 2001
  • The researches of science and engineering need the latest information from internet resources. But searching and filtering processes of appropriate web documents from huge internet resources are very complex as well as having some repeated procedures. In this paper, I propose a Personalized Agent System(PAS), which can filter World Wide Web Documents that the user is interested, such as papers. To do this, PAS uses a modified spreading activation neural network which 1 propose here. PAS observes the user´s local paper database to analyze, adapt and learn the user interests, and the then constructs the user-specified neural network model by the analyzed interests ...

  • PDF

Authoring Tool for a Cyber University (가상대학 구축을 위한 AUTHORING TOOL에 대한 연구)

  • 이달상;이춘근
    • Korea Multimedia Society
    • /
    • v.1 no.1
    • /
    • pp.65-76
    • /
    • 1997
  • We discuss the characteristics of authoring tool for the lecture on demand(LOD) in a cyber university. Authoring tool will be one of the important tools for constructing LOD that gives good educational opportunities to students of cyber university. The one of characteristics in authoring tool is“Education”and“Entertainment”. The LOD system constructed with authoring tool will be impact on multimedia telecommunication, technology for constructing and searching multimedia database, GroupWare and distributing technology, etc.

  • PDF