• The Journal of the Korea Contents Association
• /
• v.12 no.4
• /
• pp.31-39
• /
• 2012

DVC(Distributed Video Coding) techniques have been attracting a lot of research works since these enable us to implement the light-weight video encoder and to provide good coding efficiency by introducing the feedback channel. However, the feedback channel causes the decoder to increase the decoding complexity and requires very high decoding latency because of numerous iterative decoding processes. So, in order to reduce the decoding delay and then to implement in a real-time environment, this paper proposes several parity bit estimation methods which are based on the temporal correlation, spatial correlation and spatio-temporal correlations between LDPCA frames on each bit plane in the consecutive video frames in pixel-domain Wyner-Ziv video coding scheme and then the performances of these methods are compared in fast DVC scheme. Through computer simulations, it is shown that the adaptive spatio-temporal correlation-based estimation method and the temporal correlation-based estimation method outperform others for the video frames with the highly active contents and the low active contents, respectively. By using these results, the proposed estimation schemes will be able to be effectively used in a variety of different applications.

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

Multi-Level Marketing distribution process to reduce occurs in a number of the distribution costs to consumers of reducing its profits outside the area subject to the non-store or stores is the way to a special sale. Japan for the multi-level marketing Article 33 of the Act on Specified Commercial Transactions at or below the regulatory chain is defined as dealers. However, unlike other legislative attention two -dimensional chain for sales transactions are regulated. A chain of Japanese regulations on sales transactions, the definition is very specific and detailed regulations, and the chain is specifically for sales transactions in detail how to take regulatory and regulatory relief of pre- and post- regulatory focus, and the streamlining of regulatory aimed at restrictions on how the implications of such a large country.

• The Journal of the Korea Contents Association
• /
• v.13 no.6
• /
• pp.9-19
• /
• 2013

In this paper, we develop a Spatio-Temporal graph as of a key component of our knowledge representation Scheme. We design an integrated representation scheme to depict not only present and past but future in parallel with the spaces in an effective and intuitive manner. An event in general occupies not only a space but a time. Hence a crucial premise for the simulation of virtual situations is to position events in the multi-dimensional context, that is, 3-D space extended by the temporal dimension. Furthermore an event tends to have physical, social and mental aspects intertwined. As a result we need diverse information structures and functions to model entities and relations associated with events and to describe situations in different stances or perspectives of the virtual agents. These structures and functions are implemented in terms of integrated and intuitive representation schemes at different levels such as Ontology View, Instance View, ST View, Reality View. The resulting multi-dimensional comprehensive knowledge structure accommodates multi-layered virtual world developing in the time to maximize the diversity of situations in the historical context. The viability of this knowledge representation scheme is demonstrated with a typical scenario applied to a simulator implemented based on the ST Graph. The virtual stage based on the ST graph can be used to provide natural contexts for situated learning or next-generation simulation games.

• The Journal of the Korea Contents Association
• /
• v.17 no.2
• /
• pp.404-414
• /
• 2017

With the development of smartphones and online social networks, users produce a lot of contents and share them with each other. Therefore, users spend time by viewing or receiving the contents they do not want. In order to solve such problems, schemes for recommending useful contents have been actively studied. In this paper, we propose a contents recommendation scheme using collaborative filtering for users on online social networks. The proposed scheme consider a user trust in order to remove user data that lower the accuracy of recommendation. The user trust is derived by analyzing the user activity of online social network. For evaluating the user trust from various points of view, we collect user activities that have not been used in conventional techniques. It is shown through performance evaluation that the proposed scheme outperforms the existing scheme.

• The Journal of the Korea Contents Association
• /
• v.5 no.1
• /
• pp.179-187
• /
• 2005

Linear order Concentrators and Superconcentrators have been studied extensively for their ability to interconnect large numbers of devices in parallel, whether in communication systems or in parallel computers. One major limitation on the efficiency of parallel computer designs has been the prohibitively high cost of parallel communication between processors and memories. Linear order concentrators, O(n), can be used to construct theoretically optimal interconnection network schemes. Existing explicitly the defined constructions are based on expanders, which have large constant factors, thereby rendering them impractical lot reasonable sized networks. It demands the construction of concentrator which uses the expander with the smaller expansion constant. This paper introduces an improvement on the method of constructing concentrators using expanders, which reduce the size of resulting concentrator built from any given expander by a constant factor.

• The Journal of the Korea Contents Association
• /
• v.7 no.1
• /
• pp.103-115
• /
• 2007

The vulnerability issue on IEEE 802.1x wireless LAN has been permits the malicious attack such as Auth/Deauth flooding more serious rather than we expected. Attacker can generate huge volume of malicious traffic as the same methods on existing wired network. The objective of wireless IP Traceback is to determine the real attack sources, as well as the full path taken by the wireless attack packets. Existing IP Traceback methods can be categorized as proactive or reactive tracing. But, these existing schemes did not provide enhanced performance against DoS attack on wireless traffic. In this paper, we propose a 'TTL based advanced Packet Marking' mechanism for wireless IP Packet Traceback with wireless Classification function. Proposed mechanism can detect and control DoS traffic on AP and can generate marked packet for reconstructing on the real path from the non-spoofed wireless attack source, by which we can construct secure wireless network based on AP with enhance traceback performance.

• The Journal of the Korea Contents Association
• /
• v.7 no.4
• /
• pp.20-29
• /
• 2007

Although E-mail system is considered as a most important communication media, 'Spam' is flooding the Internet with many copies of the same message, in an attempt to force the message on people who would not otherwise choose to receive it. Most spam is commercial advertising, often for dubious products, get-rich-quick schemes, or quasi-legal services. Therefore advanced anti-spam techniques are required to basically reduce its transmission volume on sender mail server or MTA, etc. In this study, we propose a new sender authentication model with encryption function based on modified DomainKey with SMS for Spam mail protection. From the SMS message, we can get secret information used for verification of its real sender on e-mail message. And by distributing this secret information with SMS like out-of-band channel, we can also combine proposed modules with existing PGP scheme for secure e-mail generation and authentication steps. Proposed scheme provide enhanced authentication function and security on Spam mail protection function because it is a 'dual mode' authentication mechanism.

• The Journal of the Korea Contents Association
• /
• v.16 no.2
• /
• pp.374-386
• /
• 2016

Provenance means the meta data that represents the history or lineage of a data in collaboration storage environments. Therefore, as provenance has been accruing over time, it takes several ten times as large as the original data. The schemes for effciently compressing huge amounts of provenance are required. In this paper, we propose a provenance compression scheme considering the RDF graph patterns. The proposed scheme represents provenance based on a standard PROV model and encodes provenance in numeric data through the text encoding. We compress provenance and RDF data using the graph patterns. Unlike conventional provenance compression techniques, we compress provenance by considering RDF documents on the semantic web. In order to show the superiority of the proposed scheme, we compare it with the existing scheme in terms of compression ratio and the processing time.

• The Journal of the Korea Contents Association
• /
• v.17 no.11
• /
• pp.60-69
• /
• 2017

Recently, with the rapid development of internet and smart phones, social network services that can create and share various information through relationships among users have been actively used. Especially as the amount of information becomes enormous and unreliable information increases, expert recommendation that can offer necessary information to users have been studied. In this paper, we propose an expert recommendation scheme considering users' interests, human relations, and response quality. The users' interests are evaluated by analyzing their past activities in social network. The human relations are evaluated by extracting the users who have the same interesting fields. The response quality is evaluated by considering the user's response speed and response contents. The proposed scheme determines the user's expert score by combining the users' interests, the human relations, and the response quality. Finally, we recommend proper experts by matching queries and expert groups. It is shown through various performance evaluations that the proposed scheme outperforms the existing schemes.

• The Journal of the Korea Contents Association
• /
• v.20 no.10
• /
• pp.715-725
• /
• 2020

In this paper, we propose an optimization scheme for a k-Nearest Neighbor(k-NN) query, which finds k objects closest to the query in the high dimensional feature vectors. The k-NN query is converted and processed into a range query based on the range that is likely to contain k data. In this paper, we propose an optimization scheme using DNN model to derive an optimal range that can reduce processing cost and accelerate search speed. The entire system of the proposed scheme is composed of online and offline modules. In the online module, a query is actually processed when it is issued from a client. In the offline module, an optimal range is derived for the query by using the DNN model and is delivered to the online module. It is shown through various performance evaluations that the proposed scheme outperforms the existing schemes.