Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of Digital Contents Society
Journal Basic Information
Journal DOI :
Digital Contents Society
Editor in Chief :
Volume & Issues
Volume 14, Issue 4 - Dec 2013
Volume 14, Issue 3 - Sep 2013
Volume 14, Issue 2 - Jun 2013
Volume 14, Issue 1 - Mar 2013
Selecting the target year
A Study of Efficient CPLD Low Power Algorithm
Youn, Choong-Mo ; Kim, Jae-Jin ;
Journal of Digital Contents Society, volume 14, issue 1, 2013, Pages 1~5
DOI : 10.9728/dcs.2013.14.1.1
In this paper a study of efficient CPLD low power algorithm is proposed. Proposed algorithm applicate graph partition method using DAG. Circuit representation DAG. Each nodes set up cost. The feasible cluster create according to components of CPLD. Created feasible cluster generate power consumption consider the number of OR-term, the number of input and the number of output. Implement a circuit as select FC having the minimum power consumption. Compared with experiment , and power consumption was decreased. The proposed algorithm is efficient. this paper, we proposed FPGA algorithm for consider the power consumption.
Performance Comparison of Implementation Technologies for Image Quality Enhancement Operations on Android Platforms
Lee, Ju-Ho ; Lee, Goo-Yeon ; Jeong, Choong-Kyo ;
Journal of Digital Contents Society, volume 14, issue 1, 2013, Pages 7~14
DOI : 10.9728/dcs.2013.14.1.7
As mobiles devices with high-spec camera built in are used widely, the visual quality enhancement of the high-resolution images turns out to be one of the key capabilities of the mobile devices. Due to the limited computational resources of the mobile devices and the size of the high-resolution images, we should choose an image processing algorithm not too complex and use an efficient implementation technology. One of the simple and widely used image quality enhancement algorithms is contrast stretching. Java libraries running on a virtual machine, JNI (Java Native Interface) based native C/C++, and NEONTM SIMD (Single Instruction Multiple Data) are common implementation technologies in the case of Android smartphones. Using these three implementation technologies, we have implemented two image contrast stretching algorithms - linear and equalized, and compared the computation times. The native C/C++ and the NEONTM SIMD outperformed the native C/C++ implementation by 56-78 and 50-76 time faster respectively.
Scaling down data/index page structure of the NVRAM based DBMS with the small size blocks
Bae, Sang-Hee ; Lee, Taehwa ; Cha, Jaehyuk ;
Journal of Digital Contents Society, volume 14, issue 1, 2013, Pages 15~23
DOI : 10.9728/dcs.2013.14.1.15
In response to the demands of large-scale data processing with low-power and new application, a storage system using SSD (Solid State Disk/Drive) with fast input-output performance instead of hard disc has appeared as storage device. Studies on methods to overcome specific problems of SSD such as various processing data units, out-place-update and limited delete count have been actively conducted. However, declining performance and stability have not been resolved yet when storing case specific data with small scale that causes frequent random write in hard disc or SSD. This thesis suggests a system structure that stores index requesting frequent random write in NVRAM capable of byte access by using characteristics such as byte unit fast read / write of NVRAM, non-volatile and smaller size of actual changed data size in index page than block size.
A Performance Analysis of Mobile P2P Streaming Service on Wireless LAN Environments
Choi, Hun-Hoi ; Kim, Geun-Hyung ;
Journal of Digital Contents Society, volume 14, issue 1, 2013, Pages 25~33
DOI : 10.9728/dcs.2013.14.1.25
P2P(Peer-to-Peer) architecture can reduce the network bandwidth and resource on the server since peers exchange data chunks with each other, while server-client architecture causes a lot of traffic on the server. Peers receive a data more reliably when the number of participating peer increases. Currently, P2P traffic has accounted for about 65% of the world's Internet traffic and diverse P2P streaming services have launched combining to video streaming technology. However, the requirements and data chunk delivery algorithms for mobile P2P streaming service should be investigated, since the existing P2P technologies have been developed and designed for the wired network. In particular, the bandwidth fluctuation caused by user mobility, wireless packet collisions, and packet losses brings about different problems on the mobile P2P streaming service compared to existing P2P streaming service. In this paper, we analyzed the problem of mobile P2P streaming services in the 802.11n wireless LAN environment through experiments.
A Study on Slurry Isolation Through Chemical Processing, with Comparative Analysis and Validation
Na, Wonshik ;
Journal of Digital Contents Society, volume 14, issue 1, 2013, Pages 35~40
DOI : 10.9728/dcs.2013.14.1.35
The use of slurry with a mix of abrasives and coolant for making Wire Saw in the photovoltaic industry has sharply increased with the semiconductor wafer. In this paper, the slurry was isolated, purified and dried by microwave drying method with high-purity silicon carbide powder obtained through chemical processing. Dried slurry bulk was first pulverized and chemical treatment was applied to produce powder. The produced slurry powder was then analyzed by going through the following analysis; thermal analysis, particle size analyses: SEM shots, elemental analysis, XRF and XRD. The results of this study found the recovery rate of the power obtained though the chemical processing to be higher than the one obtained from mineral processing. The results anticipate infrastructure building and active responses to increasingly stronger domestic and international environmental regulations through the integration and recycling of large amounts of slurry in the photovoltaic industry.
Generation of Dynamic Sub-groups for Social Networks Analysis
Lee, Hyunjin ;
Journal of Digital Contents Society, volume 14, issue 1, 2013, Pages 41~50
DOI : 10.9728/dcs.2013.14.1.41
Social network analysis use the n nodes with l connections. About dozens or hundreds number of nodes are reasonable for social network analysis to the entire data. Beyond such number of nodes it will be difficult to analyze entire data. Therefore, it is necessary to separate the whole social networks, a method that can be used at this time is Clustering. You will be able to easily perform the analysis of the features of social networks and the relationships between nodes, if sub-group consists of all the nodes by Clustering. Clustering algorithm needs the interaction with the user and computer because it is need to pre-set the number of sub-groups. Sub-groups generated like this can not be guaranteed optimal results. In this paper, we propose dynamic sub-groups creating method using the external community association. We compared with previous studies by the number of sub-groups and sub-groups purity standards. Experimental results show the excellence of the proposed method.
A File Clustering Algorithm for Wear-leveling
Lee, Taehwa ; Cha, Jaehyuk ;
Journal of Digital Contents Society, volume 14, issue 1, 2013, Pages 51~57
DOI : 10.9728/dcs.2013.14.1.51
Storage device based on Flash Memory have many attractive features such as high performance, low power consumption, shock resistance, and low weight, so they replace HDDs to a certain extent. An Storage device based on Flash Memory has FTL(Flash Translation Layer) which emulate block storage devices like HDDs. A garbage collection, one of major functions of FTL, effects highly on the performance and the lifetime of devices. However, there is no de facto standard for new garbage collection algorithms. To solve this problem, we propose File Clustering Algorithm. File Clustering Algorithm respect to update page from same file at the same time. So, these are clustered to same block. For this mechanism, We propose Page Allocation Policy in FTL and use MIN-MAX GAP to guarantee wear leveling. To verify the algorithm in this paper, we use TPC Benchmark. So, The performance evaluation reveals that the proposed algorithm has comparable result with the existing algorithms(No wear leveling, Hot/Cold) and shows approximately 690% improvement in terms of the wear leveling.
A Study on the Low Power Algorithm for a Task
Kim, Jae-Jin ;
Journal of Digital Contents Society, volume 14, issue 1, 2013, Pages 59~64
DOI : 10.9728/dcs.2013.14.1.59
In this paper, we proposed low power algorithm for a task. The task means the inside of a necessary processor and external resources to work accomplishment of a system. Each task analyzes a life time and a number of called for implement a low power circuit. First of all, reduce power consumption of a task have maximum power consumption for low power circuit implementation. Therefore, first selecting a task had maximum power consumption. The task had a maximum power consumption ranking consider a life time and a number of called for each task. While a life time of task is long, top priority ranking to decrease power consumption to the task that the number of call generates the power consumption how a disguise is large in case of a lot of task becomes. Frequency decision to have minimum power consumption, and decrease power consumption all the circuit by a change of frequency of the task which the minimum task that a wasting past record is the maximum becomes. Also, keep continuously minimum power consumption, with every effort task until last life time in opening life time, and decrease gets total power consumption. Experiments results show reduction in the power consumption by 5.43% comparing with that  algorithm.
Evaluation of DES key search stability using Parallel Computing
Yoon, JunWeon ; Choi, JangWon ; Park, ChanYeol ; Kong, Ki-Sik ;
Journal of Digital Contents Society, volume 14, issue 1, 2013, Pages 65~72
DOI : 10.9728/dcs.2013.14.1.65
Current and future parallel computing model has been suggested for running and solving large-scale application problems such as climate, bio, cryptology, and astronomy, etc. Parallel computing is a form of computation in which many calculations are carried out simultaneously. And we are able to shorten the execution time of the program, as well as can extend the scale of the problem that can be solved. In this paper, we perform the actual cryptographic algorithms through parallel processing and evaluate its efficiency. Length of the key, which is stable criterion of cryptographic algorithm, judged according to the amount of complete enumeration computation. So we present a detailed procedure of DES key search cryptographic algorithms for executing of enumeration computation in parallel processing environment. And then, we did the simulation through applying to clustering system. As a result, we can measure the safety and solidity of cryptographic algorithm.
A Study on Effective Advertisement Offer System using Digital Information Display
Kang, Min-Sik ;
Journal of Digital Contents Society, volume 14, issue 1, 2013, Pages 73~80
DOI : 10.9728/dcs.2013.14.1.73
The advertisement using DID(Digital Information Display) has been a huge increase in many public spaces. Many company has been advertise their products through DID in recent. In this paper, we suggest more effective advertisement system on DID for advertisers. This system can provide a floating population, operation information and other useful informations for advertisement. The advertisers can choose and buy the advertisement that they want.
Secure Mobile Credit Card Payment Protocol based on Certificateless Signcryption
Choi, Hui-Jin ; Kim, Hyung-Jung ;
Journal of Digital Contents Society, volume 14, issue 1, 2013, Pages 81~88
DOI : 10.9728/dcs.2013.14.1.81
The increase of the smartphone users has popularized the mobile payment and the mobile credit card users are rapidly getting increased. The mobile credit cards that currently used provide its users with the service through downloading mobile credit card information into USIM. The mobile credit card saved in USIM has the minimized information for the security and is based on PKI. However certificate-based payment system has a complicated procedure and costs a lot of money to manage the certificates and CRL(Certificate Revocation List). Furthermore, It can be a obstacle to develop local e-commerce in Korea because it is hard for foreigners to use them. We propose the secure and efficient mobile credit card payment protocol based on certificateless signcryption which solve the problem of certificate use.
A Locality based Resource Management Scheme for Hierarchical P2P Overlay Network in Ubiquitous Computing
Hong, Chung-Pyo ; Kim, Cheong-Ghil ; Kim, Shin-Dug ;
Journal of Digital Contents Society, volume 14, issue 1, 2013, Pages 89~95
DOI : 10.9728/dcs.2013.14.1.89
Many peer-to-peer (p2p) systems have been studied in distributed, ubiquitous computing environments. Distributed hash table (DHT)-based p2p systems can improve load-balancing even though locality utilization and user mobility are not guaranteed. We propose a mobile locality-based hierarchical p2p overlay network (MLH-Net) to address locality problems without any other services. MLH-Net utilizes mobility features in a mobile environment. MLH-Net is constructed as two layers, an upper layer formed with super-nodes and a lower layer formed with normal-nodes. The simulation results demonstrate that MLH-Net can decrease discovery routing hops by 13% compared with JXTA and 69% compared with Chord. It can decrease the discovery routing distance by 17% compared with JXTA and 83% compared with Chord depending on the environment.
A Study on the Classification of Next Generation Contents Convergence Industry
Kil, Jin-Ho ; Shin, Minsoo ;
Journal of Digital Contents Society, volume 14, issue 1, 2013, Pages 97~109
DOI : 10.9728/dcs.2013.14.1.97
Recently the value and importance of contents industry is rapidly increasing. In particular, consumption on contents convergence integrating contents and new technologies is being increased as smart devices become popular. Next generation contents convergence industry is being recognized as a new engine for national economic development. However there is no concrete framework defining next generation contents convergence industry. This fact brings about serious problems in defining the scope of the industry. To develop effectively new industry, there is a strong need to define types of contents convergence based on dominant factors leading content convergence trend while shedding light on contents, technologies and industry. To define classification of next generation contents convergence indudstry, this study analyzes attributes of contents convergence and carries out conjoint analysis. Based on the attributes found from conjoint analysis, the study suggests new classification scheme of contents convergence industry.
On Exploiting New Methods of Language Acquisition Offered by the Internet
Choi, Mi-Hee Michelle ;
Journal of Digital Contents Society, volume 14, issue 1, 2013, Pages 111~116
DOI : 10.9728/dcs.2013.14.1.111
Instructive lessons in the language classrooms are extremely constrictive to language learners in improving their English skills, thus, the use of technology in education plays an important role in a language classroom. Results of language proficiency improvement of the learners vary depending on the extent of supplementary materials offered by the internet delivered to the learners. The purpose of the present study is to explore and propose a new approach of language acquisition offered by the internet. This study presents effective methods of using the internet in carrying out the written work. In this paper, we show that the relationship between participation of the learners in the class activities and improvement of English writing skills are mutually proportional.
Illumination Influence Minimization Method for Efficient Object
Kim, Jae-Seoung ; Lee, Ki-Jung ; Whangbo, Taeg-Keun ;
Journal of Digital Contents Society, volume 14, issue 1, 2013, Pages 117~124
DOI : 10.9728/dcs.2013.14.1.117
This paper suggests the robust method of extraction for moving objects in illumination variation by using image sequence from an immovable camera. The most difficult part of the implication is the effect by illumination and noise. The object area is hardly estimated when the dusky area occurs in illumination variation by time change. This thesis describes the extraction of moving objects employed by Gaussian mixture model which is noise robust measure. Also, the report suggests the elimination method of illumination part in input image by the representative illumination image which is defined to minimize the illumination influence.