http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
개별검색 DB통합검색이 안되는 DB는 DB아이콘을 클릭하여 이용하실 수 있습니다.
통계정보 및 조사
예술 / 패션
<해외전자자료 이용권한 안내>
- 이용 대상 : RISS의 모든 해외전자자료는 교수, 강사, 대학(원)생, 연구원, 대학직원에 한하여(로그인 필수) 이용 가능
- 구독대학 소속 이용자: RISS 해외전자자료 통합검색 및 등록된 대학IP 대역 내에서 24시간 무료 이용
- 미구독대학 소속 이용자: RISS 해외전자자료 통합검색을 통한 오후 4시~익일 오전 9시 무료 이용
※ 단, EBSCO ASC/BSC(오후 5시~익일 오전 9시 무료 이용)
This media conversion in which webtoons are remediated to movies and dramas has taken off since the mid-2000s. Webtoons may be favorable for media conversion into movies and dramas as the story as finished and has proven to be fun with a fixed readership: however, only a small number of webtoon were successful box office hits or received high viewer ratings. Then in 2017, the movie <Along with the God: The Two Worlds> based on the webtoon, succeed in attracting more more then 10 million viewers. In this regard, this study derived the success factors by comparing and analyzing the narrative structure and visual elements of <Along with the God: The Two Worlds>, which was the biggest hit movie, with the original webtoon. The case analysis showed that there are two necessary elements for success: a text configuration of strategy optimized for media conversion, which is based on understanding the different media characteristics of webtoon and movie; and a configuration strategy that exaggerates the personalities of the characters and compresses the story of a webtoon which features various events and many characters in a long series, in consideration of the characteristics of movie which needs to give a big impact in 2 hours.
In this study, we learned about the emergence of on-line communications originating from peoseuteol Computer Communications, the limitations of online communication, and the definition, traits and development of emoticons that serve as complementary roles, such as emotion and status. After analyzing various literacture and references, it was found that the emoticons functioned as a function of communicating the visual language of the digital era and communicating more sensitively to emotional factors. In a multimedia environment, emoticons are developed at a more advanced stage as the users' own icons due to a stronger tendency to pursue particularity and uniqueness. It is expected that eomotions added with multimedia functions will be more popular and vary in type. However, although the diversification of emotions as a commercial tool is already actively progressing, there appears a reverse effect in which an excessive use of emoticons is considered insincere in online communications. In such a background, research should be conducted that can support a systematic and effective development of emoticons through visual research rather than producing multimedia emoticons indiscreetly.
데이터베이스 관리 시스템의 핵심 알고리즘인 해쉬 조인은 해싱을 위한 메모리가 부족한 경우(즉, 해쉬 테이블 오버플로우) 디스크 입출력를 유발하게 된다. 하드디스크를 임시 저장공간으로 사용할 경우, 해쉬 조인의 probing 단계에서 과도한 임의 읽기로 인해 I/O 시간이 성능을 저하시키게 된다. 한편, 플래시메모리 SSD가 저장장치로 각광을 받고 있으며, 머지않아 엔터프라이즈 환경에서 하드디스크를 대체할 것으로 예상 된다. 하드디스크와 달리, 기계적인 동작 장치가 없는 플래시메모리 SSD의 경우 임의 읽기에서 빠른 성능을 보이기 때문에 해쉬 조인의 성능을 크게 향상시킬 수 있다. 본 논문에서는 플래시 메모리 SSD를 해쉬 조인을 위한 임시 저장공간으로 사용할 경우의 몇 가지 중요하고 현실적인 이슈들을 다룬다. 우선, 해쉬 조인의 I/O 패턴을 자세히 설명하고, 하드디스크에 비해 플래시메모리 SSD가 수십 배에 가까운 성능 향상을 보이는 이유를 설명한다. 다음으로, 클러스터 크기(즉, 해쉬 조인 알고리즘에서 사용하는 I/O 단위)가 성능에 미치는 영향을 제시하고 분석한다. 마지막으로, 하드디스크의 경우, DBMS의 질의 최적화기가 산출하는 비용이 실 수행시간과 편차가 클 수 있는데 반해, 플래시메모리 SSD의 경우 비용 산출을 정확히 하게 됨을 실험적으로 보인다. 결론적으로, 플래시메모리 SSD를 해쉬 조인을 위한 임시 저장공간으로 사용할 경우, 빠른 성능과 더불어 질의 최적화기의 비용 산출이 훨씬 더 신뢰할 수 있음을 보인다. Hash join is one of the core algorithms in databases management systems. If a hash join cannot complete in one-pass because the available memory is insufficient (i.e., hash table overflow), however, it may incur a few sequential writes and excessive random reads. With harddisk as the tempoary storage for hash joins, the I/O time would be dominated by slow random reads in its probing phase. Meanwhile, flash memory based SSDs (flash SSDs) are becoming popular, and we will witness in the foreseeable future that flash SSDs replace harddisks in enterprise databases. In contrast to harddisk, flash SSD without any mechanical component has fast latency in random reads, and thus it can boost hash join performance. In this paper, we investigate several important and practical issues when flash SSD is used as tempoary storage for hash join. First, we reveal the I/O patterns of hash join in detail and explain why flash SSD can outperform harddisk by more than an order of magnitude. Second, we present and analyze the impact of cluster size (i.e., I/O unit in hash join) on performance. Finally, we emperically demonstrate that, while a commerical query optimizer is error-prone in predicting the execution time with harddisk as temporary storage, it can precisely estimate the execution time with flash SSD. In summary, we show that, when used as temporary storage for hash join, flash SSD will provide more reliable cost estimation as well as fast performance.
The objective of cache is to reduce I/O access of physical storage device so that user accesses their data faster. Traditionally, the most important metric to measure the performance of cache is hitratio. Thus, when the cache maintains hitratio high, it is regarded as a good cache replacement policy. However, the cache miss latency is different when the storages are heterogeneous. Though the cache hitratio is high, if the cache often misses with low performance disk, then the user experiences low performance. To address this problem we proposed eviction cost estimation based cache management. In our result, the eviction cost estimation based cache management has 10~30% throughput improvement compared with LRU cache management.
These days, mobile embedded systems adopt flash memory capable of XIP feature since they can reduce memory usage, power consumption, and software load time. XIP provides direct access to ROM and flash memory for processors. However, using XIP incurs unnecessary degradation of applications' performance because direct access to ROM and flash memory shows more delay than that to main memory. In this paper, we propose a memory management framework, dynamic XIP, which can resolve the performance degradation of using XIP. Using a constrained RAM cache, dynamic XIP can dynamically change XIP region according to page access pattern to reduce performance degradation in execution time or energy consumption resulting from native XIP problem. The proposed framework consists of a page profiler gathering applications' memory access pattern using PMU and an XIP manager deciding that a page is accessed whether in main memory or in flash memory. The proposed framework is implemented and evaluated in Linux kernel. Our evaluation shows that our framework can reduce execution time at most 25% and energy consumption at most 22% compared with using XIP-only case adopted in general mobile embedded systems. Moreover, the evaluation shows that in execution time and energy consumption, our modified LRU algorithm with code page filters can reduce more than at most 90% and 80% respectively compared with applying just existing LRU algorithm to dynamic XIP.