• The Journal of the Korea Contents Association
• /
• v.21 no.8
• /
• pp.10-19
• /
• 2021

In CCVN, the existing content search and delivery protocols based on single-hop or multi-hop cause low content search ratio and high network traffic overhead. This paper proposes a RSU-based protocol for efficient content search and delivery. In the proposed protocol, an RSU chooses the candidate provider vehicle that provides the cost-minimized content delivery to the content requester vehicle. Simulation results verify that the proposed protocol achieves better performances.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.2
• /
• pp.101-108
• /
• 2014

As browsing and sharing multimedia contents through various social network services have become very common these days. there has been a rising demand for effectively provide appropriate multimedia contents to users depending on their interest and characteristics. Especially, considering the enormous volume of multimedia contents created daily, user satisfaction heavily depends on effective selection of appropriate multimedia contents. For instance, if the acquisition of contents is based on friends or related people, then it is usually considered to be more trustworthy. Facebook page is one of the social spaces where people can obtain various information of interest. Still, users have difficulty in finding proper information because Facebook generates tremendous amount of data daily. In this paper, we proposed a scheme to extract and select Facebook page contents effectively. In our proposed scheme, users are grouped based on mutual intimacy and Facebook pages of interest are selected based on the ranking of importance. We show the performance of our scheme through experiments.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.337-340
• /
• 2006

문맥광고는 인터넷 사용자들이 뉴스나 커뮤니티 사이트에서 콘텐츠를 조회할 때, 해당 콘텐츠와 일치하거나 관련성이 높은 제품 또는 서비스 정보를 제공하는 새로운 방식의 광고기법이다. 그러나 현재 제공되고 있는 서비스의 대부분은 콘텐츠와의 관계가 다소 떨어지거나, 수동적으로 광고주가 선택한 키워드 또는 카테고리 선택에 의해 서비스가 제공되고 있다. 따라서 문맥광고의 효율성을 높이기 위해서는 사용자가 조회한 콘텐츠내의 문맥정보를 분석하여 콘텐츠와의 관련성이 높은 서비스를 제공하는 방법에 대한 연구가 필요하다. 본 논문에서는 사용자가 조회한 콘텐츠의 내용과 보다 관련 있는 서비스 제공을 위해 콘텐츠의 내용을 대표할 수 있는 중요 키워드를 선정하고, 콘텐츠 내에서 추출된 키워드간의 연관성을 분석하여 콘텐츠와 관련된 서비스를 제공하는 방법에 대해 제안한다.

• The Journal of the Korea Contents Association
• /
• v.11 no.1
• /
• pp.9-15
• /
• 2011

Zero-watermarking is a digital watermarking technique that can escape from data distortion and quality degradation by no watermark insertion into digital images to be watermarked. This paper proposes DCT0CRT, a CRT-based zero-watermarking technique in the domain of DCT. One of the DC and low-frequency AC coefficients of each DCT block chosen in chaotic way from an image is selected by testing whether it satisfies the CRT-based condition matching with the watermark bit to be embedded. Such selection information forms a key to extract the watermark from the watermarked image. Experimental results show that the image quality watermarked by DCT0CRT is better than that watermarked by any other CRT-based watermarking techniques and the inserted watermark is robust against some common attacks such as sharpening, blurring, and JPEG lossy compression.

• The Journal of the Korea Contents Association
• /
• v.11 no.10
• /
• pp.41-48
• /
• 2011

In feature selection, the selective evaluation scheme for Ant Colony Optimization(ACO) has recently been proposed, which reduces computational load by excluding unnecessary or less promising candidate solutions from the actual evaluation. Its superiority was supported by experimental results. However the experiment seems to be not statistically sufficient since it used only one dataset. The aim of this paper is to analyze convergence characteristics of the selective evaluation scheme and to make the conclusion more convincing. We chose three datasets related to handwriting, medical, and speech domains from UCI repository whose feature set size ranges from 256 to 617. For each of them, we executed 12 independent runs in order to obtain statistically stable data. Each run was given 72 hours to observe the long-time convergence. Based on analysis of experimental data, we describe a reason for the superiority and where the scheme can be applied.

• Journal of Digital Contents Society
• /
• v.19 no.4
• /
• pp.739-747
• /
• 2018

With a large feature space data, feature selection has become an extremely important procedure in the Data Mining process. But the traditional feature selection methods with single process may no longer fit for this procedure. In this paper, we proposed a hybrid efficient feature selection model for high dimensional data. We have applied our model on KNHNAES data set, the result shows that our model outperforms many existing methods in terms of accuracy over than at least 5%.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10b
• /
• pp.189-193
• /
• 2006

문맥광고 또는 컨텍스트 기반 광고란 사용자들이 선택한 웹 콘텐츠 내용을 기반으로 하여 연관성 있는 광고를 자동으로 선택하여 사용자에게 제공하는 광고기법이다. 즉, 웹 사이트를 방문하는 고객을 타겟으로 하여 그들이 찾고자 하는 것과 관련된 광고를 내보냄으로써 효과적인 광고가 이루어지도록 하는 것이다. 그러나 기존의 문맥광고는 사용자가 관심을 가지는 키워드가 아닌 광고주가 선택한 키워드를 중심으로 광고 내용을 선택하기 때문에 사용자의 실제적인 관심이 반영되지 않아 광고의 효과가 떨어지는 문제점을 가지고 있다. 이러한 문제를 해결하기 위해 본 논문에서는 사용자가 웹 콘텐츠를 선택할 때 마다 사용자의 선호도를 동적으로 학습하고, 학습된 선호도를 문맥광고에 활용하는 개인화된 문맥광고를 제안한다. 실험을 위해서 제안한 방법으로 광고를 생성해서 보여주는 웹 브라우저를 구현하여 기존의 문맥광고와 개인화된 문맥광고에 대한 사용자의 평가를 비교하였다. 실험 결과 본 논문에서 제안한 개인화된 문맥광고가 ‘콘텐츠의 내용과의 연관성’, ‘사용자의 클릭여부’ 등의 항목에서 기존의 문맥광고에 비해 우수하다는 결과를 얻을 수 있었다.

• The Journal of the Korea Contents Association
• /
• v.11 no.12
• /
• pp.578-585
• /
• 2011

Nowadays, wireless local area networks are widely deployed so that stations can potentially associate with an access point. The AP selection strategy is one of the significant research areas for wireless local area networks. The selection strategy solves the relevant problem is which AP can be selected and associated with a station so that the efficient resource utilization can be obtained. Rather than merely choosing the AP with the strongest received signal strength, however, we calculate effective throughput for each neighboring AP and use it as a basis for AP selection. Referencing the throughput is better than referencing the signal strength only because the network may contain a severe load imbalance. We have performed computer simulations using OPNET modeler in order to verify the performance of the proposed scheme. The results show us that the proposed selection method outperforms that of the conventional one in terms of throughput and delay.

• Proceedings of the KAIS Fall Conference
• /
• 2010.11a
• /
• pp.235-238
• /
• 2010

멀티미디어 시대가 도래함에 따라 콘텐츠들이 인터넷을 통해 셀 수 없을 만큼 많은 양이 전송되어지고 있다. 하지만 콘텐츠를 전송할 때의 안전성과 보안성 및 저작권 문제 등은 아직도 보완해야 할 문제이다. 따라서 본 논문에서는 콘텐츠 중 이미지로 한정하여서 이 이미지의 부분의 좌표를 선택하여 그 부분만 암호화함으로써 이미지를 안전하게 보호할 수 있는 기법에 대해 연구하고자 한다.

• The KIPS Transactions:PartB
• /
• v.16B no.2
• /
• pp.101-108
• /
• 2009

As content serviced for IP set-top boxes is streamed over IP network, the existing hacking tools for IP network can be used to capture the streamed content. Until recently, most of the content serviced on IP set-top boxes has been MPEG-2 TS. However, this content will be gradually moved to WMV, MPEG-4 or H.264 because of the relatively low compression efficiency and overhead of the TS packet. In this paper, we propose a DRM scheme other than WMRM for streamed WMV content. Our approach is to design a DRM scheme independent to the existing WMV streaming system. We also design this scheme in order to provide the feature for controlling the DRM processing time considering device performance. We verified it through the experiment.