http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
필요할 때의 친구: 판소리 적벽가의 다섯 가지 우정의 요소
데이비드브라스 ( David Brass ),박재익 ( Jaeick Park ) 사단법인 아시아문화학술원 2021 인문사회 21 Vol.12 No.2
이 논문은 한국 판소리 <적벽가>의 영문판을 읽고 ‘우정’이 형성되고 유지되고 인정받는지에 대해 연구한 것이다. 다섯 가지 우정의 요소인 신실, 충성, 명예, 용서, 상호성이 다섯 명의 주요 등장인물을 통해 어떻게 구현되는지 제시하였다. 유비, 공명, 조자룡, 관우, 조조 사이에 일어나는 다섯 가지 우정의 요소를 한국문학에 두루 나타나는 유교정신과 결부하여 설명할 수 있어서 공자의 논어의 구절을 인용하여 설명하고자 하였다. 이 논문은 영문으로 번역된 한국고전문학 작품 특히 판소리를 서양인이 감상하고 분석한 것이라는 점에서 의의가 있으며, 한국문학의 주제가 동서양을 가리지 않고 공유될 수 있음을 보여주고 한국고전문학이 세계적으로 소개되고 가치가 인정될 수 있음을 보여 준다는 점에서 중요성이 있다. The purpose of this study is to examine the ways and manners in which friendships are formed, sustained and honored within the context of Jeokbyeokga in the English translation. There are five types of manners to form and sustain the friendship: sincerity, loyalty, honor, forgiveness, and reciprocation. We have divided the manners into categorical segments in order to better illustrate the friendships between each character. Among the many prominent philosophic doctrines, Confucianism was used, given the cultural context of East Asia, to supplement the analysis of the friendship concept in Jeokbyeokga. The importance of this study is that it is based on an English version of a Korean Pansori literature and the narrative is analyzed from a western view point. However, the theme within the Korean literature is commonly shared across cultures and can be appreciated globally.
Ahn, Hee-Kap,Brass, Peter,Na, Hyeon-Suk,Shin, Chan-Su Elsevier 2009 Computational geometry Vol.42 No.3
<P><B>Abstract</B></P><P>In this paper, we study the classical one-dimensional range-searching problem, i.e., expressing any interval {i,…,j}⊆{1,…,n} as a disjoint union of at most <I>k</I> intervals in a system of intervals, though with a different lens: we are interested in the minimum <I>total length</I> of the intervals in such a system (and not their number, as is the concern traditionally).</P><P>We show that the minimum total length of a system of intervals in {1,…,n} that allows to express any interval as a disjoint union of at most <I>k</I> intervals of the system is Θ(<SUP>n1+2k</SUP>) for any fixed <I>k</I>. We also prove that the minimum number of intervals k=k(n,c), for which there exists a system of intervals of total length <I>cn</I> with that property, satisfies k(n,c)=Θ(<SUP>n1c</SUP>) for any integer c⩾1. We also discuss the situation when k=Θ(logn).</P>
Covering a simple polygon by monotone directions
Ahn, H.K.,Brass, P.,Knauer, C.,Na, H.S.,Shin, C.S. Elsevier 2010 Computational Geometry Vol.43 No.5
In this paper we study the problem of finding a set of k directions for a given simple polygon P, such that for each point p@?P there is at least one direction in which the line through p intersects the polygon only once. For k=1, this is the classical problem of finding directions in which the polygon is monotone, and all such directions can be found in linear time for a simple n-gon. For k>1, this problem becomes much harder; we give an O(n<SUP>5</SUP>log<SUP>2</SUP>n)-time algorithm for k=2, and O(n<SUP>3k+1</SUP>logn)-time algorithm for fixed k>=3.