http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
박성희(Sung Hee Park),이자원(Jawon Lee),석지윤(Ji Yoon Seok) 한국수사학회 2013 수사학 Vol.0 No.19
Rhetorical genre represents a class of messages having important structural and content similarities that creates special expectations among listeners. Presidential rhetoric delivers textual features to the similar effect of creating trust and bonding people. Based on the arguments of Bitzer and Hart, this study attempts to compare and contrast two presidential addresses that were delivered in two different time and spacial settings. For this purpose, former President Park Jung Hee’s 1963 National Press Club address in Washington and President Park Geun Hye’s 2013 address in U.S. Congress in Washington were chosen. As analytic tools, Hart’s credibility strategy index and I-reference style were used, along with Bitzer’s elements in rhetorical situation. The results indicated that two Presidents showed similar patterns in their use of credibility strategy and use of I-reference positioning them in a certain role in their speeches. While two speeches, each of which 48 years apart, revealed different rhetorical situations in terms of their exigences, audiences, and contraints, respective presidents retained similar generic features in their addresses. From the results, it could be discussed that the presidential rhetoric as a generic form has a unique construct of communicating messages that pronounce their unique social role and solidate trust system in society.
( Jawon Kim ),( Hyun Ahn ),( Minjae Park ),( Sangguen Kim ),( Kwanghoon Pio Kim ) 한국인터넷정보학회 2016 KSII Transactions on Internet and Information Syst Vol.10 No.3
This paper implements an estimated ranking algorithm of closeness centrality measures in large-scale workflow-supported social networks. The traditional ranking algorithms for large-scale networks have suffered from the time complexity problem. The larger the network size is, the bigger dramatically the computation time becomes. To solve the problem on calculating ranks of closeness centrality measures in a large-scale workflow-supported social network, this paper takes an estimation-driven ranking approach, in which the ranking algorithm calculates the estimated closeness centrality measures by applying the approximation method, and then pick out a candidate set of top k actors based on their ranks of the estimated closeness centrality measures. Ultimately, the exact ranking result of the candidate set is obtained by the pure closeness centrality algorithm [1] computing the exact closeness centrality measures. The ranking algorithm of the estimation-driven ranking approach especially developed for workflow-supported social networks is named as RankCCWSSN (Rank Closeness Centrality Workflow-supported Social Network) algorithm. Based upon the algorithm, we conduct the performance evaluations, and compare the outcomes with the results from the pure algorithm. Additionally we extend the algorithm so as to be applied into weighted workflow-supported social networks that are represented by weighted matrices. After all, we confirmed that the time efficiency of the estimation-driven approach with our ranking algorithm is much higher (about 50% improvement) than the traditional approach.
Request Redirection 기법을 통한 iSCSI 프로토콜 기반 스토리지 서버의 부하분산 방안 연구
서자원(Jawon Seo),최원일(Wonil Choi),Yuan Yang,박명순(Myongsoon Park) 한국정보과학회 2005 한국정보과학회 학술발표논문집 Vol.32 No.2
유비쿼터스 환경에 대한 관심과 휴대용 컴퓨팅 기기의 보급으로 가까운 미래의 사람들은 언제 어디서나 네트워크를 통해 데이터 접근이 가능하게 될 것이다. 특히 영화나 음악과 같은 멀티미디어 데이터의 폭발적인 증가로 인해 확장성 있는 네트워크 스토리지 시스템의 필요성이 부각되고 있다. SAN(Storage Area Network)은 높은 확장성과 빠른 속도를 제공하여 엔터프라이즈 환경에 적합한 스토리지 네트워크 시스템이다. 최근에 SAN 환경은 SCSI Architecture Model(SAM)의 표준으로 채택된 iSCSI를 이용한 IP기반의 SAN으로 옮겨가고 있다. 본 논문에서는 iSCSI 기반의 IP SAN환경에서 서비스 클라이언트가 증가함에 따라 스토리지 서버의 부하가 커지는 문제를 해결하기 위해 스토리지 디바이스에서 클라이언트로 데이터를 직접 전송하는 방안을 제안한다.