• Journal of KIISE:Databases
• /
• v.30 no.2
• /
• pp.145-156
• /
• 2003

Most of the content-based image retrieval systems focuses on similarity-based retrieval of natural picture images by utilizing color. shape, and texture features. For the neuroscience image databases, we found that retrieving similar images based on global average features is meaningless to pathological researchers. To realize the practical content-based retrieval on images in neuroscience databases, it is essential to represent internal contents or semantics of images in detail. In this paper, we present how to represent image contents and their related concepts to support more useful retrieval on such images. We also describe the operational semantics to support these advanced retrievals by using object-oriented message path expressions. Our schemes are flexible and extensible, enabling users to incrementally add more semantics on image contents for more enhanced content searching.

• Journal of KIISE:Software and Applications
• /
• v.26 no.10
• /
• pp.1167-1167
• /
• 1999

Although spatial databases support an efficient spatial management on objects in the real world, they have a characteristic that process only spatial information valid at current time, So in case of change in the spatial domain, it is very hard to support an efficient historical management for time-varying spatial information because they delete an old value and then replace with new value that is valid at current time. To solve these problems, there are rapidly increasing of interest for spatiotemporal databases, which serve historical functions for spatial information as well as spatial management functions for an object. However most of them presented in an abstract time-varying spatial phenomenon, but have not presented a concrete policy in spatiotemporal databases. In this paper, we propose a spatiotemporal data model that supports bitemporal time concepts in three dimensional architecture. In the proposed model, not only data types and their operation for object of spatiotemporal databases have been classified, but also mathematical expressions using formal semantics for them have been given. Then, the data structures and their operations based on relational database model as well as object-oriented database model are presented.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2007.02a
• /
• pp.48-52
• /
• 2007

As huge amount of literature including biological data is being generated after post genome era, it becomes difficult for researcher to find useful knowledge from the biological databases. Bio-text mining and related natural language processing technique are the key issues in the intelligent knowledge retrieval from the biological databases. We propose a bio-text mining technique for the biologists who find Knowledge from the huge literature. At first, web robot is used to extract and transform related literature from remote databases. To improve retrieval speed, we generate an inverted file for keywords in the literature. Then, text mining system is used for extracting given knowledge patterns and keywords. Finally, we construct a grid computing environment to guarantee processing speed in the text mining even for huge literature databases. In the real experiment for 10,000 bio-literatures, the system shows 95% precision and 98% recall.

• The KIPS Transactions:PartB
• /
• v.11B no.5
• /
• pp.611-618
• /
• 2004

This paper addresses the design and implementation of class distribution in distributed object-oriented databases. The proposed strategy of distribution consists of two-step design of fragments. One is class fragmentation and the other is allocation of fragments. In step of class fragmentation, we have defined partitioning algorithms to reflect the characteristics of object-oriented databases such as method, inheritance and composite-object. In step of allocation, we have defined the objective function for allocation considering system operating cost including storage, query processing and communication and implemented it using Genetic Algorithm.

• Journal of KIISE:Databases
• /
• v.30 no.4
• /
• pp.372-380
• /
• 2003

Temporal databases support time-varying events so that conventional aggregate functions are extended to be processed with time for temporal aggregate functions. In the previous approach, it is done repeatedly to find time intervals and is calculated the result of each interval whenever target events are different. This paper proposes a method which processes temporal aggregate function queries using time point sequence. We can make time point sequence storing the start time and the end time of events in temporal databases in advance. It is also needed to update time point sequence due to insertion or deletion of events in temporal databases. Because time point sequence maintains the information of time intervals, it is more efficient than the previous approach when temporal aggregate function queries are continuously requested, which have different target events.

• Journal of Information Processing Systems
• /
• v.14 no.3
• /
• pp.709-726
• /
• 2018

Database classification is an important preprocessing step for the multi-database mining (MDM). In fact, when a multi-branch company needs to explore its distributed data for decision making, it is imperative to classify these multiple databases into similar clusters before analyzing the data. To search for the best classification of a set of n databases, existing algorithms generate from 1 to ($n^2-n$)/2 candidate classifications. Although each candidate classification is included in the next one (i.e., clusters in the current classification are subsets of clusters in the next classification), existing algorithms generate each classification independently, that is, without taking into account the use of clusters from the previous classification. Consequently, existing algorithms are time consuming, especially when the number of candidate classifications increases. To overcome the latter problem, we propose in this paper an efficient approach that represents the problem of classifying the multiple databases as a problem of identifying the connected components of an undirected weighted graph. Theoretical analysis and experiments on public databases confirm the efficiency of our algorithm against existing works and that it overcomes the problem of increase in the execution time.

• The Journal of Korean Obstetrics and Gynecology
• /
• v.35 no.4
• /
• pp.57-76
• /
• 2022

Objectives: This review is aimed to figure out the effectiveness of herbal medicine for treating threatened abortion by analyzing randomized controlled trials. Methods: We searched relevant studies using seven databases including 4 domestic databases and 3 foreign databases. Data retrieval was conducted on May 18, 2022. and the papers published from January 1, 2018 to May 18, 2022 were included. The risk of bias was assessed by using Cochrane's risk of bias tool. Results: 182 studies were searched in domestic and foreign databases, and 9 studies were finally selected. Among 9 studies, the treatment group was treated with only oral herbal medicine in 4 studies and with combined treatment of herbal medicine and western medicine in 5 studies. On the other hand, the control group was treated with only western medicine. In all 9 studies, evaluation indexes in the treatment group showed more effectiveness than those of the control group, evaluation indexes were different for each study though. Conclusions: Herbal medicine was more effective for treating threatened abortion whether using it alone or combining with western medicine compared to using western medicine alone. Additional studies which include large number are needed to confirm long-term effectiveness and safety of herbal medicine treatment.

• The Journal of Pediatrics of Korean Medicine
• /
• v.37 no.3
• /
• pp.49-74
• /
• 2023

Objectives The aim of this study was to analyze the research trends in herbal medicine as a treatment for atopic dermatitis (AD) in an animal model. Methods We conducted a search targeting papers published from 2013 onwards in Korean and English databases. The search terms were focused on "AD", "dermatitis", and "Korean medicine". Only animal experimental studies involving the oral administration of single or complex prescriptions of Korean medicine were included, whereas in vitro studies, local administration studies, and studies of specific components of Korean medicine were excluded. We searched the PubMed and Embase databases for English databases and the Science on Research Information Sharing Service (RISS) and Korean Studies Information Service System (KISS) databases for Korean studies. Results Among the herbal medicine intervention groups, the most commonly used single herbs were baekseonpi, danggui, and douchi, whereas a mixture of hwangryun and gamcho was used in three studies, making it the most frequently used combination. There were significant improvements in indicators related to the symptoms of AD and various pro-inflammatory markers. Conclusions These results indicate the efficacy of herbal medicines in the treatment of AD in animal models. However, this study had several limitations. Therefore, future systematic reviews that address these limitations and provide more comprehensive analyses are required.

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

• The Journal of Information Systems
• /
• v.19 no.4
• /
• pp.25-49
• /
• 2010

As companies introduced ERP (Enterprise Resource Planning) systems since the middle of 1990s, the databases of the companies has become centralized and gigantic. The companies are now developing data-mining based applications on those centralized and gigantic databases for knowledge management. Almost of them are using $Pro^*C$/C++, a embedded SQL programming language, and it's because the $Pro^*C$/C++ is independent of platforms and also fast. However, they suffer from difficulties in development and maintenance due to the characteristics of corporate databases which have intrinsically large number of tables and fields. The purpose of this research is to design and implement a methodology which makes it easier to develop and maintain embedded SQL applications based on relational databases. Firstly, this article analyzes the syntax of $Pro^*C$/C++ and addresses the concept of repetition and duplication which causes the difficulties in development and maintenance of corporate information systems. Then, this article suggests a management architecture of source codes and databases in which a preprocessor generates $Pro^*C$/C++ source codes by referring a DB table specification, which would solve the problem of repetition and duplication. Moreover, this article also suggests another architecture of DB administration in which the preprocessor generates DB administration commands by referring the same table specification, which would solve the problem of repetition and duplication again. The preprocessor, named $PrePro^*C$, has been developed under the UNIX command-line prompt environment to preprocess $Pro^*C$/C++ source codes and SQL administration commands, and is under update to be used in another DB interface environment like ODBC and JDBC, too.