• Journal of Pharmacopuncture
• /
• v.23 no.3
• /
• pp.142-157
• /
• 2020

Cannabis is a historical plant which has been used as a medicine in East Asia. These days, there are active debates about using cannabis in clinical field. Collecting and comparing cannabis research articles which had been published in the Opening of Japan to spot the interactions between the traditional medicine of Japan, Rangaku which was established in Edo Period and the European medicine which is transferred after Perry Expedition is academically meaningful. This study searched publications, which were listed on Open-Access databases by Dec. 11^th, 2019. We collected research articles which had been published from January 3^rd, 1867 to July 30^th, 1912 also known as Meiji era and uploaded on OpenAccess databases. Our searching databases were J-stage, CiNii (Scholarly and Academic Information Navigator), Tokyo Metropolitan Library, The National Diet Library, IRDB (Institutional Repositories DataBase) and KAKEN (Grant-in-Aid for Scientific Research Database). Searching keywords were cannabis, hemp and all their Japanese synonyms and available combinations. We selected final 15 studies which met every selection criteria in the 346,393 collected studies. Cannabis was prescribed in Meiji era of Japan to alleviate pain and cure the digestive, respiratory, urinary, and nervous system diseases such as indigestion, asthma, tuberculosis, gonorrhea and its complications, insomnia, and nervous prostration. Cannabis was medically used in Meiji era of Japan and the reporting and sharing of its clinical effect was published on the medical journals like present days. There were already Cannabis regulations in that era, but its medicinal use was more liberated than nowadays. It may be a chance to reconsider the current legal system, which strictly controls the use of Cannabis.

• Journal of Information Management
• /
• v.32 no.1
• /
• pp.108-119
• /
• 2001

Creating digital document by scanning paper or using a digital camera or using a computer is a daily task at every office. Digital document is increasing at high pace. The quantity of digital document is almost beyond the maximum capacity of the online storage and is destroying searching efficiency. To solve these problems, we developed a document management system(ChronoStar) by integrating various searching methods(Picture, Full-Text Related), 3D graphic and a DVD changer.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.9
• /
• pp.6376-6384
• /
• 2015

In practice of urban redevelopment promotion projects, since the decision-making is dependent on the verbal agreements between the participants, planning changes are frequently occur. A master plan can be utilized as an effective feedback and adjusting means for decisions. It is a difficult to establish a master plan quickly and effectively to consider the large number of information. Effective decision support system that can storage and retrieval information items systematically and efficiently necessary when planning master plan is required. In this study, a data-warehouse prototype that supports the master planning at early stage was suggested. A metadata index database was developed by identifying information items of base survey results and master plan cases. Also user interface for information searching was presented. The applicability of the prototype was evaluated by case application. It was found that the prototype allows effective searching of desired information through meta data.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.650-663
• /
• 2004

In molecular biology, DNA sequence searching is one of the most crucial operations. Since DNA databases contain a huge volume of sequences, a fast indexing mechanism is essential for efficient processing of DNA sequence searches. In this paper, we first identify the problems of the suffix tree in aspects of the storage overhead, search performance, and integration with DBMSs. Then, we propose a new index structure that solves those problems. The proposed index consists of two parts: the primary part represents the trie as bit strings without any pointers, and the secondary part helps fast accesses of the leaf nodes of the trio that need to be accessed for post processing. We also suggest an efficient algorithm based on that index for DNA sequence searching. To verify the superiority of the proposed approach, we conducted a performance evaluation via a series of experiments. The results revealed that the proposed approach, which requires smaller storage space, achieves 13 to 29 times performance improvement over the suffix tree.

• Journal of Korean Medical classics
• /
• v.21 no.1
• /
• pp.123-141
• /
• 2008

Objective Classification of herbal formulas through the analysis of compositional herb's is a suitable method in the aspects of the effective applications of herbal formulas. However, these classification methods have some problems in dealing with lots of herbal formulas because the estimations of herbal formula's effects are dependent upon one's memory. In this study, we aimed to establish the effective methodology to elicit the classified herbal formula's chart by introducing the DB systems without interfering with non-standard terms. Method : We entered the herbs informations of the composition of herbal formulas into database, made an alias tables of corresponding herbs, and achieved standardization of herb's informations. Using these databases, we made the classified herbal formula's chart according to the presence and the treatment informations of herbs. Results By analyzing the herbal formula into the set of compositional herbal elements, we could systemically express the parents and children herbal formula at once according to search terms. We provided the advanced searching tools entering the name of herbal formula and compositional herb together. Through these searching methods, it is facilitated to grasp the classified herbal formula's chart according to the addition and reduction of compositional herbs in Dong-uibogam(東醫寶鑑) and Bangjehak(方劑學)

• Journal of Korea Multimedia Society
• /
• v.12 no.8
• /
• pp.1172-1181
• /
• 2009

An electronic medical record (EMR) is the medical system that all the test are recorded as text data. However, domestic EMR systems have various forms of medical records. There are a lot of related works to standardize the laboratory codes as a LOINC (Logical Observation Identifiers Names and Code). However the existing researches resolve the problem manually. The manual process does not work when the size of data is enormous. The paper proposes a novel automatic LOINC mapping algorithm which uses indexing techniques and semantic similarity analysis of medical information. They use file system which is not proper to enormous medical data. We designed and implemented mapping algorithm for standardization laboratory codes in medical informatics compared with the existing researches that are only proposed algorithms. The automatic creation of searching words is being possible. Moreover, the paper implemented medical searching framework based on database system that is considered large size of medical data.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.249-252
• /
• 2009

Recently, it is possible for users to acquire necessary data easily as the various schemes of the searching information are developed. Since these data rise continuously like stream data, it is required to extract the appropriate data for the user's needs from the mass data on the internet. In the traditional scheme, they are acquired by processing the user queries after the occurred data are stored at a database. However, it is inefficient to process the user queries over the large volume of continuous data by using the traditional scheme. In this paper, we propose the query processing scheme to extract the data efficiently for the user requirements from the large volume of continuous data. On the proposed scheme, we present the Event-Profile Model to define the data occurrence on the internet as the events and the user's requirements as the profiles. We also show the filtering scheme to process the events and the profiles efficiently.

• Journal of Korean Society of Rural Planning
• /
• v.27 no.3
• /
• pp.69-84
• /
• 2021

This study aims to understand the concept of 'ruralism' in Korea by comparing with 'rurality' which were dealt with in various fields related to rural areas in Korea. This study conducted a systematic literature review as a methodology. The process is defining key questions, searching for documents, classifying documents, extracting data, and presenting results. The key questions were set to 'How has the term 'ruralism' been used in various studies?' and 'How can the concept of rurality in Korea be organized?' according to the purpose of the study. The study retrieved literature by searching on Korean academic database, RISS and DBpia, using the five keywords '농촌성', '농촌다움', '농촌다운', 'Rurality,' and 'Ruralism.' The search yielded 1,014 documents which were thereafter screened by systematic literature review process. After sifting, only 31 publications were found suitable for inclusion in the final analysis. This study organized them into four categories: rural concept, rural landscape, rural tourism, and rural development. The literature divided into four types. Type I is a study that deals only with economy·society among studies related to rurality, Type II is a study that deals with both the economic·social and physical environment, Type III is a study that deals with the physical environment of a rural area and presents the rural planning principle as maintenance and preservation. Finally, Type IV is a study that presents ruralism as a new rural planning principle for a future rural area. In the end, the study discussed some implications on defining ruralism in Korea.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.7 no.7
• /
• pp.925-934
• /
• 2017

R-tree is index structure which is frequently used for handling spatial data. However, if the number of dimensions increases, or if only partial dimensions are used for searching the certain data according to user preference, the time for indexing is greatly increased and the efficiency of the generated R-tree is greatly reduced. Hence, it is not suitable for the multidimensional data, where dimensions are continuously increasing. In this paper, we propose a multidimensional hash index, a new multidimensional index structure based on a hash index. The multidimensional hash index classifies data into buckets of euclidean space through a hash function, and then, when an actual search is requested, generates a hash search tree for effective searching. The generated hash search tree is able to handle user preferences in selected dimensional space. Experimental results show that the proposed method has better indexing performance than R-tree, while maintaining the similar search performance.

• Journal of KIISE:Databases
• /
• v.34 no.4
• /
• pp.283-303
• /
• 2007

Recently, the study of efficient way to store and retrieve enormous music data is becoming the one of important issues in the multimedia database. Most general method of MIR (Music Information Retrieval) includes a text-based approach using text information to search a desired music. However, if users did not remember the keyword about the music, it can not give them correct answers. Moreover, since these types of systems are implemented only for exact matching between the query and music data, it can not mine any information on similar music data. Thus, these systems are inappropriate to achieve similarity matching of music data. In order to solve the problem, we propose an Efficient Query-By-Humming System (EQBHS) with a content-based indexing method that efficiently retrieve and store music when a user inquires with his incorrect humming. For the purpose of accelerating query processing in EQBHS, we design indices for significant melodies, which are 1) frequent melodies occurring many times in a single music, on the assumption that users are to hum what they can easily remember and 2) melodies partitioned by rests. In addition, we propose an error tolerated mapping method from a note to a character to make searching efficient, and the frequent melody extraction algorithm. We verified the assumption for frequent melodies by making up questions and compared the performance of the proposed EQBHS with N-gram by executing various experiments with a number of music data.