• Journal of Information Management
• /
• v.24 no.4
• /
• pp.58-77
• /
• 1993

Database of journals/books are categorized into bibliographic database and clearinghouse-type databases which tell you locations of original materials. There is such a problem in the latter type of databases that those are not likely to be commercialized, although ultimate purpose which users have is to obtain original materials. We find photocopying service through on-line or full-text databases currently available, but we can't get information which meets our needs only by those databases. This paper describes major database services and how to use them by document type(journal or book). The author also discusses what future information centers utilizing databases should be.

• International Journal of Knowledge Content Development & Technology
• /
• v.10 no.3
• /
• pp.21-31
• /
• 2020

The study examined information retrieval tools as predictors for information resources utilization, four research questions, and four hypotheses were made to guide the study. A descriptive survey was adopted for the study. Random sampling technique was used to select sample of 393 from a population of 557 academic staff registered in the University of Port Harcourt library. The questionnaire was adopted as a data collection instrument titled Information retrieval as predictors for information resources utilization (IRPIRUQ). Data were analyzed using both simple and multiple regression while analysis of variance (ANOVA) associate with regression was used for testing the hypotheses at 0.05 alpha level. The study revealed that information resources are under utilized as the OPAC and Online Databases are not easily accessed. Further findings showed that the academic staff made use of internet search engines more often than the OPAC and online databases. It was recommended among others that a new library software be installed in place of KOHA for wider connectivity and adequate distribution of software that will aid usage of the online databases and OPAC.

• Journal of Information Management
• /
• v.35 no.3
• /
• pp.109-123
• /
• 2004

The problem of semantic interoperability in science and technology information is frequently raised. Well-established classification scheme will be used as a tool to interchange information between different databases without semantic inconsistency. However, there is still a practical barrier due to different classification schemes each database adopts. Accordingly, it is urgent to harmonize or reconcile those classifications with each other. This paper aims to solve semantic inconsistencies occurred when interchanging information between databases having different classification schemes, the Standard National Sci-Tech Classification and the Standard KISTI Classification. For the purpose a conceptual analysis of science and technology are performed and five consistency/inconsistency types are analyzed based on some examples.

• Journal of the Korean Wood Science and Technology
• /
• v.18 no.2
• /
• pp.49-66
• /
• 1990

In order to identify an unknown wood sample native to Korea. the softwood databases(KSWCHUN; Korean SoftWood CHUN) and the hardwood databases(KHWCHUN; Korean HardWood CHUN) had been built. and the new computer searching programs(IDINEX; IDentification INformation EXpress) has been written in Turbo Pascal(V.5.0) and in Macro Assembly(V.5.0). The characters of the data were based on the 74 features of softwood and on the 148 features of hardwood which are a part of new "IAWA list of microscopic features for hardwood identification" published in 1989. For the purpose of this investigation the wood anatomical nature of 25 species of softwood(13 genera of 5 families) and of 112 species of hardwood(57 genera of 31 families) were observed under a scanning electron microscope and light microscope. and a lot of literature used. The IDINEX programs are based on edge-punched card keys. with several improvements. The maximum number of features in the IDINEX is 229. but that is fixed for a given database. Large numbers of taxa are handled efficiently and new taxa easily added. A search may be based on sequence numbers of features. Comparisons are made sequentially by feature and taxon using the entire suite of features specified to produce the list of possible matching taxa. The results are followings. (1) The databases of Korean wood and the searching programs(IDINEX) had been built. (2) The databases of Korean wood could be an information to search an unknown wood. (3) The databases would be valuable. for the new features, which were not mentioned in Korean wood up to the present. were observed in details. (4) The ultrastructures of the cell walls(warty layer) and crystals observed under a scanning electron microscope will be helpful to search an unknown wood in particular. (5) The searching process is more quick and accurate than the others. 6) We can obtain the information on the differences of a species from the other and search an unknown wood using probability. in IDINEX, (7) The IDINEX will be utilized to identify and classify an animal life, vegetable world, mineral kingdom, and so on.

• Bioinformatics and Biosystems
• /
• v.1 no.1
• /
• pp.46-50
• /
• 2006

According to the advancement of experimental techniques in molecular biology, genomic and protein sequence databases are increasing in size exponentially, and mean sequence lengths are also increasing. Because the sizes of these databases become larger, it is difficult to search similar sequences in biological databases with significant homologies to a query sequence. In this paper, we present the N-gram indexing method to retrieve similar sequences fast, precisely and comparably. This method regards a protein sequence as a text written in language of 20 amino acid codes, adapts N-gram tokens of fixed-length as its indexing scheme for sequence strings. After such tokens are indexed for all the sequences in the database, sequences can be searched with information retrieval algorithms. Using this new method, we have developed a protein sequence search system named as ProSeS (PROtein Sequence Search). ProSeS is a protein sequence analysis system which provides overall analysis results such as similar sequences with significant homologies, predicted subcellular locations of the query sequence, and major keywords extracted from annotations of similar sequences. We show experimentally that the N-gram indexing approach saves the retrieval time significantly, and that it is as accurate as current popular search tool BLAST.

• Molecules and Cells
• /
• v.42 no.1
• /
• pp.8-16
• /
• 2019

Mutations in the ${\beta}-catenin$ gene (CTNNB1) have been implicated in the pathogenesis of some cancers. The recent development of cancer genome databases has facilitated comprehensive and focused analyses on the mutation status of cancer-related genes. We have used these databases to analyze the CTNNB1 mutations assembled from different tumor types. High incidences of CTNNB1 mutations were detected in endometrial, liver, and colorectal cancers. This finding agrees with the oncogenic role of aberrantly activated ${\beta}-catenin$ in epithelial cells. Elevated frequencies of missense mutations were found in the exon 3 of CTNNB1, which is responsible for encoding the regulatory amino acids at the N-terminal region of the protein. In the case of metastatic colorectal cancers, in-frame deletions were revealed in the region spanning exon 3. Thus, exon 3 of CTNNB1 can be considered to be a mutation hotspot in these cancers. Since the N-terminal region of the ${\beta}-catenin$ protein forms a flexible structure, many questions arise regarding the structural and functional impacts of hotspot mutations. Clinical identification of hotspot mutations could provide the mechanistic basis for an oncogenic role of mutant ${\beta}-catenin$ proteins in cancer cells. Furthermore, a systematic understanding of tumor-driving hotspot mutations could open new avenues for precision oncology.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.3-6
• /
• 2007

KISTI(Korea Institute of Science & Technology Information) CCBB(Center for Computational Biology and Bioinformatics) Website has been providing bioinformatics contents(databases and analysis tools) services to construct IT-based bioinformatics infrastructure. It also carries out the services to support domestic bioinformatics R&D activity and to construct the infrastructure. But, these services are not actively available because this CCBB website is not wellknown to users. Therefore, we performed the user survey for the researchers who are studying in the field of biological science. The items of this survey consist of subjects on bioinformatics databases, analysis tools and BioInfoNet. After the user survey is rearranged and analyzed, the result of survey will be used to provide the good service to the users who are need of bioinformatics infrastructure such as databases and analysis tools etc.

• International Journal of Knowledge Content Development & Technology
• /
• v.6 no.1
• /
• pp.41-68
• /
• 2016

This paper aims to analyze the function of database management systems from the perspective of librarians working in engineering institutions in Andhra Pradesh. Ninety-eight librarians from one hundred thirty engineering institutions participated in the study. The paper reveals that training by computer suppliers and software packages are the significant mode of acquiring DBMS skills by librarians; three-fourths of the librarians are postgraduate degree holders. Most colleges use database applications for automation purposes and content value. Electrical problems and untrained staff seem to be major constraints faced by respondents for managing library databases.

• Journal of Electrical Engineering and information Science
• /
• v.1 no.1
• /
• pp.164-172
• /
• 1996

The partitioning of related objects should be performed before clustering for an efficient access in object-oriented databases. In this paper, a horizontal partition of related objects in object-oriented databases is presented. All subclass nodes in a class inheritance hierarchy of a schema graph are shrunk to a class node in the graph that is called condensed schema graph because the aggregation hierarchy has more influence on the partition than the class inheritance hierarchy. A set function and an accessibility function are defined to find a maximal subset of related objects among the set of objects in a class. A set function maps a subset of the domain class objects to a subset of the range class objects. An accessibility function maps a subset of the objects of a class into a subset of the objects of the same class through a composition of set functions. The algorithm derived in this paper is to find the related objects of a condensed schema graph using accessibility functions and set functions. The existence of a maximal subset of the related objects in a class is proved to show the validity of the partition algorithm using the accessibility function.

• Food Science of Animal Resources
• /
• v.42 no.5
• /
• pp.744-761
• /
• 2022

The liquid chromatography mass spectrometry (LC-MS)-based metabolomic and lipidomic methodology has great sensitivity and can describe the fingerprint of metabolites and lipids in pork and beef. This approach is commonly used to identify and characterize small molecules such as metabolites and lipids, in meat products with high accuracy. Since the metabolites and lipids can be used as markers for many properties of a food, they can provide further evidence of the foods authenticity claim. Chromatography coupled to mass spectrometry is used to separate lipids and metabolites from meat samples. The research data usually is compared to lipid and metabolite databases and evaluated using multivariate statistics. LC-MS instruments directly connected to the metabolite and lipid databases software can be used to assess the authenticity of meat products. LC-MS has good selectivity and sensitivity for metabolomic and lipidomic analysis. This review highlighted the combination of metabolomics and lipidomics can be used as a reference for analyzing authentication meat products.