• Journal of the Korean Society of Food Science and Nutrition
• /
• v.40 no.8
• /
• pp.1099-1106
• /
• 2011

Cucumber fermentation has been used as a means of preservation. This study was performed to investigate the effects of fermented cucumber beverage (CF) containing beneficial materials for an ethanol hangover based on Hovenia dulcis (SKM) on ethanol-induced hepatotoxicity. Male Sprague-Dawley rats were randomly divided into three groups: ethanol control, ethanol plus SKM, and ethanol plus CF+SKM. SKM or CF+SKM was orally administered at a dose of 7 mL/kg body weight once per day for 5 weeks. Control rats were given an equal amount of water. CF+SKM significantly lowered plasma ethanol levels, whereas SKM tended to decrease the levels compared to the control. Both SKM and CF+SKM significantly lowered the plasma acetaldehyde levels and serum transaminase activities compared to those in the control. SKM and CF+SKM did not affect hepatic alcohol dehydrogenase activity; however, it significantly inhibited cytochrome P450 2E1 (CYP2E1) activity. Hepatic aldehyde dehydrogenase (ALDH) activity was significantly higher in the SKM and CF+SKM groups than that in the control group. Plasma acetaldehyde concentration was significantly correlated with hepatic CYP2E1 (r=0.566, p<0.01) activity and ALDH (r=-0.564, p<0.01) activity. Hepatic superoxide dismutase and catalase activities as well as glutathione content increased with the SKM and CF+SKM administration, whereas lipid peroxide content decreased significantly. Furthermore, SKM and CF+SKM lowered plasma and hepatic lipid content and lipid droplets compared to those in the control group. These results indicate that SKM and CF+SKM exhibit hepatoprotective properties partly by inhibiting CYP2E1 activity, enhancing ALDH activity and stimulating the antioxidant defense systems in ethanol-treated rats.

• Annual Conference on Human and Language Technology
• /
• 2014.10a
• /
• pp.81-86
• /
• 2014

한국어 의존 파싱은 문장 내 단어의 지배소를 찾음으로써 문장의 구조적 중의성을 해소하는 작업이다. 지배소 후위 원칙은 단어의 지배소는 자기 자신보다 뒤에 위치한다는 원리로, 한국어 구문분석을 위하여 널리 사용되는 원리이다. 본 연구에서는 한국어 지배소 후위 원리를 의존 파싱을 위한 트랜지션 시스템의 제약 조건으로 적용하여 2가지 트랜지션 시스템을 제안한다. 제안 모델은 기존 트랜지션 시스템 중 널리 사용되는 arc-standard와 arc-eager 알고리즘에 지배소 후위 제약을 적용한 포워드(forward) 기반 트랜지션 시스템과, 트랜지션 시스템의 단점인 에러 전파(error propagation)를 완화시키기 위하여 arc-eager 알고리즘의 lazy-reduce 방식을 적용한 백워드(backward) 기반 트랜지션 시스템이다. 실험은 세종 구구조 말뭉치를 의존구조로 변환하여 실험하였고, 실험 결과 백워드 기반 트랜지션 시스템이 포워드 방식보다 우수한 성능을 보였다. 기존 연구와의 비교를 위하여 기존 연구를 조사하였지만 세부 실험 환경이 서로 달라서 직접적인 비교는 어려웠다. 제안하는 시스템의 최고 성능은 UAS 92.85%, LAS 90.82% 이다.

• Journal of Information Management
• /
• v.42 no.3
• /
• pp.167-186
• /
• 2011

Co-citation means that two or more studies are cited together by a later study. This paper deals with the relationship between co-citation and author disambiguation. Author disambiguation is to cluster same-name author instances into real-world individuals. Co-citation may influence author disambiguation in terms that two or more related research works performed by the same person may be co-cited by some later studies. This article describes automated steps to gather co-citation information from Google scholar, and proposes a new clustering algorithm to effectively integrate co-citation information with other author disambiguation features. Experiments showed that co-citation helps to improve the performance of author disambiguation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06b
• /
• pp.4-6
• /
• 2006

본 논문은 자연언어처리에서 문장의 서술어와 그 서술어가 가지는 명사 논항들 사이의 문법관계를 의미 관계로 사상하는 즉 논항이 서술어에 대해 가지는 역할을 정하는 문제를 다루고 있다. 의미역 결정은 단어의 의미 중의성 해소와 함께 자연언어의 의미 분석의 핵심 문제 중 하나이며 반드시 해결해야 하는 매우 중요한 문제 중 하나이다. 본 연구에서는 언어학적으로 유용한 자원인 세종전자사전을 이용하여 용언격틀사전을 구축하고 격틀 선택 방법으로 의미역을 결정한 후. 결정된 의미역들에 대한 확률 정보를 확률 모델에 적용하여 반복적으로 학습하는 부트스트래핑(Bootstrapping) 알고리즘을 사용하였다. 실험 결과, 기본 모델에 대해 10% 정도의 성능 향상을 보였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12C
• /
• pp.181-189
• /
• 2001

In this thesis, a policing algorithm is proposed, which is one of the traffic management function in ATM networks. The proposed algorithm minimizes CLR(Cell Loss patio) of high priority cells and solves burstiness problem of the traffic caused by multiplexing and demultiplexing process. The proposed algorithm has been implemented with VHDL and is divided into three parts, which are an input module, an UPC module, and an output module. In implementation of the UPC module\`s memory access, memory address is assigned according to VCI\`s LSB(Lowest Significant Byte) of ATM header for convenience. And the error of VSA operation from counter\`s wrap-around can be recovered by the proposed method. ANAM library 0.25 $\mu\textrm{m}$ and design compiler of Synopsys are used for synthesis of the algorithm and Synopsys VSS tool is used for VHDL simulation of it

• Journal of Information Management
• /
• v.42 no.1
• /
• pp.47-62
• /
• 2011

While an ideal author graph should have its nodes to represent authors, automatically-generated author graphs mostly use author names as their nodes due to the difficulty of resolving author names into individuals. However, employing author names as nodes of author graphs merges namesakes, otherwise separate nodes in the author graph, into the same node, which may distort the characteristics of the author graph. This study proposes an algorithm which resolves author ambiguities based on co-authorship and then yields an author graph consisting of not author name nodes but author nodes. Scientific collaboration relationship this algorithm depends on tends to produce the clustering results which minimize the over-clustering error at the expense of the under-clustering error. In experiments, the algorithm is applied to the real citation records where Korean namesakes occur, and the results are discussed.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.2
• /
• pp.131-138
• /
• 2004

Considering international trends and foreign cases, it can be easily expected that web accessibility issue is becoming more and more important. While information technology has changed Korean society rapidly and widely, there are many People who have difficulties in using information services such as the elderly and persons with disabilities. One of the big barriers they face is the lack of accessibility of web services. These social problems have been rarely studied in Korea but surface as very import subjects to be addressed concerning IT and welfare policy. The objective of this study is to ensure web accessibility right for visually handicapped and reduce digital divide through development of a recommendation guideline of mobile internet user interface. In this study the trends of politics and laws related to web accessibility in developed countries are surveyed and some advisable recommendation guidelines of mobile internet user interface for visually handicapped to improve web accessibility are proposed.

• KIISE Transactions on Computing Practices
• /
• v.22 no.2
• /
• pp.83-88
• /
• 2016

Subtopic mining is the extraction and ranking of possible subtopics, which disambiguate and specify the search intentions of an input query in terms of relevance, popularity, and diversity. This paper describes the limitations of previous studies on the utilization of web resources, and proposes a subtopic mining method with a two-level hierarchy based on hierarchical search intentions and web resources, in order to overcome these limitations. Considering the characteristics of resources provided by the official subtopic mining task, we extract various second-level subtopics reflecting hierarchical search intentions from web documents, and expand and re-rank them using other provided resources. Terms in subtopics with wider search intentions are used to generate first-level subtopics. Our method performed better than state-of-the-art methods in almost every aspect.

• Journal of KIISE:Software and Applications
• /
• v.27 no.6
• /
• pp.668-677
• /
• 2000

Korean has the characteristics that case postpositions determine the syntactic roles of phrases and a postposition may have more than one meanings. In particular, the adverbial postpositions make translation from Korean to English difficult, because they can have various meanings. In this paper, we describe a method for resolving such semantic ambiguities of Korean adverbial postpositions using decision trees. The training examples for decision tree induction are extracted from a corpus consisting of 0.5 million words, and the semantic roles for adverbial postpositions are classified into 25 classes. The lack of training examples in decision tree induction is overcome by clustering words into classes using a greedy clustering algorithm. The cross validation results show that the presented method achieved 76.2% of precision on the average, which means 26.0% improvement over the method determining the semantic role of an adverbial postposition as the most frequently appearing role.

• Journal of the Korean Society for information Management
• /
• v.25 no.3
• /
• pp.27-39
• /
• 2008

In bibliographic data, the use of personal names to indicate authors makes it difficult to specify a particular author since there are numerous authors whose personal names are the same. Resolving same-name author instances into different individuals is called author resolution, which consists of two steps: calculating author similarities and then clustering same-name author instances into different person groups. Author similarities are computed from similarities of author-related bibliographic features such as coauthors, titles of papers, publication information, using supervised or unsupervised methods. Supervised approaches employ machine learning techniques to automatically learn the author similarity function from author-resolved training samples. So far however, a few machine learning methods have been investigated for author resolution. This paper provides a comparative evaluation of a variety of recent high-performing machine learning techniques on author disambiguation, and compares several methods of processing author disambiguation features such as coauthors and titles of papers.