• Journal of Korean Medical classics
• /
• v.23 no.5
• /
• pp.67-82
• /
• 2010

Globalization describes a process by which regional cultures have become integrated through a global network of communication. In order to communicate among different cultural groups, standardization of terminology is one of the most important steps among its processes. In the field of oriental medicine, there have been continuous efforts to communicate through various methods. Translation of oriental medical classics is one of the significant approaches in terms of transmitting medical theories and clinical experiences of thousands of years to the people of different cultural backgrounds. However, previous translation studies have had difficulties in delivering its underlying principles and assumptions due to lack of standardization of terminology. "WHO International Standard Terminologies on Traditional Medicine in the Western Pacific Region(WHO-IST)" is the outcome of developing standard terminologies on oriental medicine based on mutual agreement of researchers of Korea, China and Japan. As a movement to find more efficient methodology for communication between heterogeneous communities, this study aims to translate parts of "Classic of difficult issues(難經)" into English adopting "WHO-IST" hoping to set a model of translation study.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.7
• /
• pp.1-7
• /
• 2017

As the capacity of NAND flash module increases, the amount of RAM increases for caching and maintaining the FTL mapping information. In order to reduce the amount of mapping information managed in the RAM, a demand-based address mapping method stores the entire mapping information in the flash and some valid mapping information in the form of cache in the RAM so that the RAM can be used efficiently. However, when cache miss occurs, it is necessary to read the mapping information recorded in the flash, so overhead occurs to translate the address. If the RAM space is not enough, the cache hit ratio decreases, resulting in greater overhead. In this paper, we propose a method using two tables called TPMT(Translation Page Mapping Table) and SMT(Segmented Translation Page Mapping Table) to utilize both temporal locality and spatial locality more efficiently. A performance evaluation shows that this method can improve the cache hit ratio by up to 30% and reduces the extra translation operations by up to 72%, compared to the TPM scheme.

• Journal of Internet Computing and Services
• /
• v.1 no.1
• /
• pp.1-14
• /
• 2000

Visual information retrieval and image databases are very important applications of spatial access methods. The quaries for these applications are visual and based not on exact match but on dubjective similarity. The individual aperations of spatial access methods are much more expensive than those of conventional one-dimensional access methods. Also, because the visual queries are much more complex than textual queries, an efficient processing technique for visual queries is one of the critical requirements in the development of large and scalable image databases. Therefore, efficient translation and execution for the complex visual queries are not less important than those of textual databases. In this paper, we introduce our cognitive and topological studies that are required to process subjective visual queries effectively. Then, we propose an efficient translation and execution techniques for similarity based visual queries by conducting these related studies.

• Bulletin of the Korean Chemical Society
• /
• v.32 no.9
• /
• pp.3489-3492
• /
• 2011

• The KIPS Transactions:PartB
• /
• v.17B no.6
• /
• pp.459-466
• /
• 2010

Natural language processing has several ambiguity problems, and English-Korean machine translation especially includes those problems to be solved in each translation step. This paper focuses on resolving part-of-speech ambiguity of English words in order to improve the efficiency of English analysis, which is in part of efforts for developing practical English-Korean machine translation system. In order to improve the efficiency of the English analysis, the part-of-speech determination must be fast and accurate for being integrated with machine translation system. This paper proposes the probabilistic models for part-of-speech determination. We use Penn Treebank corpus in building the probabilistic models. In experiment, we present the performance of the part-of-speech determination models and the efficiency improvement of the machine translation system by the proposed part-of-speech determination method.

• Journal of the Korean Society for Library and Information Science
• /
• v.43 no.1
• /
• pp.313-332
• /
• 2009

Cross-language text categorization(CLTC) can classify documents automatically using training set from other language. In this study, collections appropriated for CLTC were extracted from KTSET. Classification performance of various CLTC methods were compared by SVM classifier using machine translation. Results showed that the classification performance in the order of poly-lingual training method, training-set translation and test-set translation. However, training-set translation could be regarded as the most useful method among CLTC, because it was efficient for machine translation and easily adapted to general environment. On the other hand, low performance was shown to be due to the feature reduction or features with no subject characteristics, which occurred in the process of machine translation of CLTC.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.2
• /
• pp.77-88
• /
• 2009

According to the size of NAND flash memory as the storage system of mobile device becomes large, the performance of address translation and life cycle management in FTL (Flash Translation Layer) to interact with file system becomes very important. In this paper, we propose the continuity counters, which represent the number of continuous physical blocks whose logical addresses are consecutive, to reduce the number of address translation. Furthermore we propose the prefetching method which preloads frequently accessed pages into main memory to enhance I/O performance of flash memory. Besides, we use the 2-bit write prediction and asynchronous writing method to predict addresses repeatedly referenced from host and prevent from writing overhead. The experiments show that the proposed method improves the I/O performance and extends the life cycle of flash memory. As a result, proposed CFTL (Clustered Flash Translation Layer)'s performance of address translation is faster 20% than conventional FTLs. Furthermore, CFTL is reduced about 50% writing time than that of conventional FTLs.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.7
• /
• pp.680-693
• /
• 2008

Recent studies on XML filtering assume that all data sources follow a single global schema defined in a filtering system. However, beyond this simple assumption, a filtering system can provide a service that allows data publishers to have their own schema; hence, the data sources will become heterogeneous. The number of data sources is expected to be large in a filtering system and the data sources are frequently published, updated, and disappeared, that is, dynamic. In this paper, we introduce implementing a simple and efficient XPath query translation method for such a dynamic environment. The method is especially targeted for a query which is composed based only on users' knowledge and experience without a graphical guidance of the global schema. When a user queries a large number of heterogeneous data, there is a high possibility that the query is not consistent with the same local schema assumed by the user. Our query translation method also supports a function for this problem. Some experimental results for query translation performance have shown that our method has reasonable performance, and is more practical than the existing method.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.1
• /
• pp.136-146
• /
• 1995

In this paper, a Japanese morphological analyzer for Japanese to Korean Machine Translation System is designed. The analyzer reconstructs the Japanese input sentence into word phrases that include grammatical and dictionary informations. Thus we propose the algorithm to separate morphemes and then connect them by reference to a corresponding Korean word phrases. And we define the connector to control Japanese word phrases It is used in controlling the start and the end point of the word phrase in the Japanese sentence which is without a space. The proposed analyzer uses the analysis dictionary to perform more efficient analysis than the existing analyzer. And we can decrease the number of its dictionary searches. Since the analyzer, proposed in this paper, for Japanese to Korean Machine Translation System processes each word phrase in consideration of the corresponding Korean word phrase, it can generate more accurate Korean expressions than the existing one which places great importance on the generation of the entire sentence structure.

• Journal of Information Technology Applications and Management
• /
• v.9 no.2
• /
• pp.71-80
• /
• 2002

Automatic language translation has greatly advanced due to the increased user needs and Information retrieval in WWW. This paper utilizes the integrated knowledge bases of noun and verb networks for automatic translation of ambiguous words in the Korean sentences, through the selectional restriction relation in the sentences. And this paper presents the method to verify validity of Korean noun semantic networks that are used for the construction of the selectional restriction relation by applying the networks to the syntactic and semantic properties Integration of Korean Noun Networks into the SENKOV system will provide the accurate and efficient knowledge bases for the semantic analysis of Korean NLP.