• Journal of Intelligence and Information Systems
• /
• v.19 no.4
• /
• pp.39-53
• /
• 2013

The emergence of the internet technology and SNS has increased the information flow and has changed the way people to communicate from one-way to two-way communication. Users not only consume and share the information, they also can create and share it among their friends across the social network service. It also changes the Social Media behavior to become one of the most important communication tools which also includes Social TV. Social TV is a form which people can watch a TV program and at the same share any information or its content with friends through Social media. Social News is getting popular and also known as a Participatory Social Media. It creates influences on user interest through Internet to represent society issues and creates news credibility based on user's reputation. However, the conventional platforms in news services only focus on the news recommendation domain. Recent development in SNS has changed this landscape to allow user to share and disseminate the news. Conventional platform does not provide any special way for news to be share. Currently, Social News Service only allows user to access the entire news. Nonetheless, they cannot access partial of the contents which related to users interest. For example user only have interested to a partial of the news and share the content, it is still hard for them to do so. In worst cases users might understand the news in different context. To solve this, Social News Service must provide a method to provide additional information. For example, Yovisto known as an academic video searching service provided time dependent metadata from the video. User can search and watch partial of video content according to time dependent metadata. They also can share content with a friend in social media. Yovisto applies a method to divide or synchronize a video based whenever the slides presentation is changed to another page. However, we are not able to employs this method on news video since the news video is not incorporating with any power point slides presentation. Segmentation method is required to separate the news video and to creating time dependent metadata. In this work, In this paper, a time dependent metadata-based framework is proposed to segment news contents and to provide time dependent metadata so that user can use context information to communicate with their friends. The transcript of the news is divided by using the proposed story segmentation method. We provide a tag to represent the entire content of the news. And provide the sub tag to indicate the segmented news which includes the starting time of the news. The time dependent metadata helps user to track the news information. It also allows them to leave a comment on each segment of the news. User also may share the news based on time metadata as segmented news or as a whole. Therefore, it helps the user to understand the shared news. To demonstrate the performance, we evaluate the story segmentation accuracy and also the tag generation. For this purpose, we measured accuracy of the story segmentation through semantic similarity and compared to the benchmark algorithm. Experimental results show that the proposed method outperforms benchmark algorithms in terms of the accuracy of story segmentation. It is important to note that sub tag accuracy is the most important as a part of the proposed framework to share the specific news context with others. To extract a more accurate sub tags, we have created stop word list that is not related to the content of the news such as name of the anchor or reporter. And we applied to framework. We have analyzed the accuracy of tags and sub tags which represent the context of news. From the analysis, it seems that proposed framework is helpful to users for sharing their opinions with context information in Social media and Social news.

• The Journal of the Korea Contents Association
• /
• v.16 no.11
• /
• pp.525-536
• /
• 2016

As obtaining information via the Internet has increased recently, the importance of web-based user interface more than ever is being emphasized. The purpose of this study is to improve the sliding structures of submenu in pull-down menu for improving web user interface. Animation techniques applied to the submenu of the pull-down menus that are being used at many web sites have very monotonous sliding structures. In order to solve these problems, a new sliding algorithm based on enlarging/reducing and moving animation techniques with direction control in pull-down menu is proposed. As a result, the proposed method can not only improve visual effects significantly but be also easily applied to the implementation of the web-based user interface in comparison with the previous pull-down menus. Finally, experiments on application of the proposed sliding algorithm to responsive image slider show that the proposed method can achieve good results. Further studies taking into account performance are needed to implement web-based interactive contents using the proposed method.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.31-39
• /
• 2007

To perform on-line cyber education, it is indispensable to delivery contents file to participant users. When users' requests occur simultaneously in a shot period, server falls into overload phase. A common to avoid overload is a software solution based on P2P, which does no cost any additional expense. But, in this solution, it yields many problems such as service delay and system failure because of peer self-control. In this paper we propose an efficient load balancing policy based on P2P system. which is the contents delivery system for cyber education system using idle computing power in the proposed solution, we present server selection scheme called P2P-Pattern method, which results in minimum service delay. we can see that our scheme outperforms previous scheme.

• The Journal of the Korea Contents Association
• /
• v.18 no.3
• /
• pp.70-80
• /
• 2018

Due to the recent development of social media and mobile devices, graph data have been using in various fields. In addition, caching techniques for reducing I/O costs in the process of large capacity graph data have been studied. In this paper, we propose a multi-layer caching scheme considering the connectivity of the graph, which is the characteristics of the graph topology, and the history of the past subgraph usage. The proposed scheme divides a cache into Used Data Cache and Prefetched Cache. The Used Data Cache maintains data by weights according to the frequently used sub-graph patterns. The Prefetched Cache maintains the neighbor data of the recently used data that are not used. In order to extract the graph patterns, their past history information is used. Since the frequently used sub-graphs have high probabilities to be reused, they are cached. It uses a strategy to replace new data with less likely data to be used if the memory is full. Through the performance evaluation, we prove that the proposed caching scheme is superior to the existing cache management scheme.

• Journal of Korea Multimedia Society
• /
• v.12 no.5
• /
• pp.677-687
• /
• 2009

Despite the fact that the mobile environment has favorable conditions for using data contents, it is not easy to implement enhanced data services for mobile broadcasting based on MPEG-4 BIFS. With a structure inherited from VRML, BIFS targets different types of content with a development approach that is not very compatible with broadcasting contents. Furthermore, it is not easy to implement BIFS because the standard is too complicated for the mobile broadcasting environment. Accordingly, this study proposes an enhanced mobile TV contents model that provides interactive 3D objects and GUI for the viewers to interact with the broadcasting contents. By applying the model to the DMB environment, this study suggests a direction for future developments of mobile broadcasting contents. In order to represent 3D graphics on mobile TV, we analyzed MPEG-BIFS 3D nodes and composed a subset of VRML profile, and defined new nodes that can efficiently represent GUI at the content development level. If this study helps facilitate expression of 3D graphics and interactions in data contents composition, enhanced efficiency of contents development is expected to promote the development of various contents suitable for the mobile broadcasting environment.

• Journal of Convergence for Information Technology
• /
• v.9 no.5
• /
• pp.1-6
• /
• 2019

As the mobile market expands, a variety of platforms are available to provide multimodal media content. Multimodal media content contains heterogeneous data, accordingly, user requires much time and effort to select preferred content. Therefore, in this paper we propose multimodal media content classification using keyword weighting for recommendation. The proposed method extracts keyword that best represent contents through keyword weighting in text data of multimodal media contents. Based on the extracted data, genre class with subclass are generated and classify appropriate multimodal media contents. In addition, the user's preference evaluation is performed for personalized recommendation, and multimodal content is recommended based on the result of the user's content preference analysis. The performance evaluation verifies that it is superiority of recommendation results through the accuracy and satisfaction. The recommendation accuracy is 74.62% and the satisfaction rate is 69.1%, because it is recommended considering the user's favorite the keyword as well as the genre.

• Proceedings of the Korea Contents Association Conference
• /
• 2015.05a
• /
• pp.75-76
• /
• 2015

본 논문에서는 대용량의 프로버넌스를 압축 저장하기 위한 OPM 기반의 RDF 프로버넌스 압축 기법을 제안한다. 제안하는 기법은 이미 존재하는 데이터 프로버넌스 및 새로운 데이터 프로버넌스를 사전을 기반으로 숫자 데이터로 인코딩한다. 또한 데이터 처리의 중복되는 부분은 서브그래프를 통해 압축한다.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.11a
• /
• pp.596-600
• /
• 2005

In High-speed Portable Internet system to improve performance of whole system, adaptive modulation and coding technology is used, this technology changes modulation and encoding techniques depending on wireless channel environment. Modulation technology that is used in High-speed Portable Internet system is BPSK, QPSK, 16QAMs and 64QAMs. If terminal is distant from base station transceiver system, BPSK or QPSK technology Is used and 16QAMs or 64QAM technology is used if is near in the base station transceiver system. In this paper, number of sub-channel in each modulation technology minimized total transmitting number of PDU is analyzed for efficient radio resources usage. For this, simulation is conducted and the results are presented at High-speed Portable Internet system environments.

• Proceedings of the Korea Contents Association Conference
• /
• 2017.05a
• /
• pp.19-20
• /
• 2017

최근 소셜 미디어와 센서 장비의 기술의 발달로 그래프 데이터의 양이 급격히 증가 하였다. 그래프 데이터의 처리 과정에서 I/O 비용이 발생하여 데이터가 많아지면 병목현상으로 인해 데이터의 처리와 관리에 있어 성능에 한계가 발생한다. 이러한 문제를 해결하기 위해 데이터를 메모리에서 관리하는 캐시 기법에 대한 연구가 이루어 졌다. 본 논문에서는 서브그래프 데이터의 접근 패턴을 고려한 캐싱 기법을 제안한다. 그래프 환경에서 그래프 질의 이력을 통해 패턴을 찾고 질의 관리 테이블과 FP(frequent pattern)-Tree 통해 선별된 데이터를 메모리에 적재시킨다. 또한, 캐시 실패(cache miss)가 발생 하였을 때, 주변의 이웃 정점을 같이 메모리에 적재시킨다. 메모리가 가득 찰 경우 캐시 된 데이터를 퇴출시키는 교체 전략을 제안한다.

• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1256-1265
• /
• 2003

Content Delivery Network(CDN) is a mechanism to deliver multimedia content to end users on behalf of web content providers. Provider's content is distributed from content server to a set of delivery platforms located at Internet Service Providers(ISPs) through the CDN in order to realize better performance and availability than the system of centralized provider's servers. Existing work on CDN has primarily focused on techniques for efficiently multicasting the content from content server to the delivery platforms or to end users. Multimedia contents usually require broader bandwidth and accordingly WDM broadcast network has been highly recommended for the infrastructure network of CDN. In this paper, we propose methods for partitioning a multicast group into smaller subgroups using the previous status of receivers. Through the computer simulation, we show that proposed algorithm are useful to reduce the average receiver's waiting time and the number of transmissions.