Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of the Korea Society of Computer and Information
Journal Basic Information
Journal DOI :
Korean Society of Computer Information
Editor in Chief :
Volume & Issues
Volume 19, Issue 12 - Dec 2014
Volume 19, Issue 11 - Nov 2014
Volume 19, Issue 10 - Oct 2014
Volume 19, Issue 9 - Sep 2014
Volume 19, Issue 8 - Aug 2014
Volume 19, Issue 7 - Jul 2014
Volume 19, Issue 6 - Jun 2014
Volume 19, Issue 5 - May 2014
Volume 19, Issue 4 - Apr 2014
Volume 19, Issue 3 - Mar 2014
Volume 19, Issue 2 - Feb 2014
Volume 19, Issue 1 - Jan 2014
Selecting the target year
A New Clustering Method for Minimum Classification Error
Heo, Gyeong-Yong ; Kim, Seong-Hoon ;
Journal of the Korea Society of Computer and Information, volume 19, issue 7, 2014, Pages 1~8
DOI : 10.9708/jksci.2014.19.7.001
Clustering is one of the most popular unsupervised learning methods, which is widely used to form clusters with homogeneous data. Clustering was used to extract contexts corresponding to clusters and a classification method was applied to each context or cluster individually. However, it is difficult to say that the unsupervised clustering is the best context forming method from the view of classification. In this paper, a new clustering method considering classification was proposed. The proposed method tries to minimize classification error in each cluster when a classification method is applied to each context locally. For this purpose, the proposed method adds constraints forcing two data points belong to the same class to have small distances, and two data points belong to different classes to have large distances in each cluster like in linear discriminant analysis. The usefulness of the proposed method is confirmed by experimental results.
A Parallel Memory Suitable for SIMD Architecture Processing High-Definition Image Haze Removal in High-Speed
Lee, Hyung ;
Journal of the Korea Society of Computer and Information, volume 19, issue 7, 2014, Pages 9~16
DOI : 10.9708/jksci.2014.19.7.009
Since the haze removal algorithm using dark channel prior was introduced, many researches for improving processing speed have been addressed even if it presented impressive results. Remarkable one is using median dark channel prior. Although it has been considered as a very attactive method, processing speed is as low as ever. So, a parallel memory model which is suitable for SIMD architecture processing haze removal on high-definition images in high-speed is introduced in this paper. The proposed parallel memory model allows to access n pixels simultaneously. It is also support stride 3, 5, 7, and 11 in order to execute convolution mask operations, e.g., median filter. The proposed parallel memory model can therefore support enough data bandwidth to process the algorithm using median dark channel prior in high-speed.
Distinction of Real Face and Photo using Stereo Vision
Shin, Jin-Seob ; Kim, Hyun-Jung ; Won, Il-Yong ;
Journal of the Korea Society of Computer and Information, volume 19, issue 7, 2014, Pages 17~25
DOI : 10.9708/jksci.2014.19.7.017
In the devices that leave video records, it is an important issue to distinguish whether the input image is a real object or a photo when securing an identifying image. Using a single image and sensor, which is a simple way to distinguish the target from distance measurement has many weaknesses. Thus, this paper proposes a way to distinguish a simple photo and a real object by using stereo images. It is not only measures the distance to the target, but also checks a three-dimensional effect by making the depth map of the face area. They take pictures of the photos and the real faces, and the measured value of the depth map is applied to the learning algorithm. Exactly through iterative learning to distinguish between the real faces and the photos looked for patterns. The usefulness of the proposed algorithm was verified experimentally.
Analysis of the Film's Promotional Website - Focus on Motion Graphic
Min, Jang-Geun ; Han, Sang-Hoon ;
Journal of the Korea Society of Computer and Information, volume 19, issue 7, 2014, Pages 27~35
DOI : 10.9708/jksci.2014.19.7.027
Motion Graphic developed in the visual fields such as film and TV is widely used from the fields of arts such as applied paintings to interactive media such as web sites. In particular, Motion Graphic is actively used in the film's promotion websites with the form of a mixture between characteristics of visual media and characteristics of websites. In this study, we analyze the characteristics of film's promotion websites, investigate previous studies for Motion Graphic analysis. And present a model for the analysis of websites including visual elements, media elements and motion elements as main elements. We select some of promotion websites for films among 2013 domestic hot films, carry out a case analysis, and present the direction of development on the base of the results.
The Design and An Implementation of effective algorithms Effect Based on XNA Game Development Environment
Seo, Jeong-Man ; Choi, Chang-Soo ;
Journal of the Korea Society of Computer and Information, volume 19, issue 7, 2014, Pages 37~46
DOI : 10.9708/jksci.2014.19.7.037
In this paper, by using Visual C # XNA game development application relates to a technique. This paper proposes the design and an implement effective algorithms Effect Based on XNA Game Development Environment. Existing in the development of the game using Directx C++ game developers, game development, it is necessary to position a lot of the source code. Particularly effective effect was much difficulty in the processing section. However, to eliminate this difficulty was proposed in the paper. The possibility of developing the game in XNA-based group. For the superiority of the proposed paper and the comparative analysis of existing games were designed for the development of the game was. The future study will be the design of various effects and events which give more immersive game implementation.
An Implementation Strategy for the Physical Security Threat Meter Using Information Technology
Kang, Koo-Hong ;
Journal of the Korea Society of Computer and Information, volume 19, issue 7, 2014, Pages 47~57
DOI : 10.9708/jksci.2014.19.7.047
In order to publicly notify the information security (Internet or Cyber) threat level, the security companies have developed the Threat Meters. As the physical security devices are getting more intelligent and can be monitored and managed through networks, we propose a physical security threat meter (PSTM) to determine the current threat level of physical security; that is a very similar compared with the one of information security. For this purpose, we investigate and prioritize the physical security events, and consider the impact of temporal correlation among multiple security events. We also present how to determine the threshold values of threat levels, and then propose a practical PSTM using the threshold based decision. In particular, we show that the proposed scheme is fully implementable through showing the block diagram in detail and the whole implementation processes with the access controller and CCTV+video analyzer system. Finally the simulation results show that the proposed PSTM works perfectly under some test scenarios.
A Domain-based Reactive Routing Protocol for the Hybrid WMN
Kim, Ho-Cheal ;
Journal of the Korea Society of Computer and Information, volume 19, issue 7, 2014, Pages 59~70
DOI : 10.9708/jksci.2014.19.7.059
This paper propose a new wireless multi-hop routing protocol that takes the hierarchical mesh of the hybrid WMN into account. WMN that is possible to provide various applications of wireless networks still has many open issues that should be solved despite the studies carried out over a decade. Especially, in routing protocol area, a problem degrading the routing efficiency by applying one of the routing protocols, which are designed for the MANET, to the hybrid WMN be solved above all. For the improvement of the routing performance, both good routing protocol and metric are essential. However, the recent studies are only concentrated in routing metric by use of the cross-layer design. Therefore, this paper is dedicated to the routing protocol that is essential for the performance of the routing but needed more studies. The proposed protocol in this paper is reactive, and designed to reorganize the hybrid WMN with several pseudo domains, and carry out domain-based route decision. By the simulation result for the performance analysis of the proposed protocol, the average delay for the route decision was decreased by 43% compared to AODV that is the typical reactive protocol.
β Algorithm for Euler function 𝜙(n) Decryption of RSA
Lee, Sang-Un ;
Journal of the Korea Society of Computer and Information, volume 19, issue 7, 2014, Pages 71~76
DOI : 10.9708/jksci.2014.19.7.071
There is to be virtually impossible to solve the very large digits of prime number p and q from composite number n=pq using integer factorization in typical public-key cryptosystems, RSA. When the public key e and the composite number n are known but the private key d remains unknown in an asymmetric-key RSA, message decryption is carried out by first obtaining
and then using a reverse function of
. Integer factorization from n to p,q is most widely used to produce
, which has been regarded as mathematically hard. Among various integer factorization methods, the most popularly used is the congruence of squares of
, a=(p+q)/2,b=(q-p)/2 which is more commonly used then n/p=q trial division. Despite the availability of a number of congruence of scares methods, however, many of the RSA numbers remain unfactorable. This paper thus proposes an algorithm that directly and immediately obtains
. The proposed algorithm computes
< n <
to obtain the solution. It has been found to be capable of finding an arbitrarily located
in a range of
much more efficiently than conventional algorithms.
A Realtime Malware Detection Technique Using Multiple Filter
Park, Jae-Kyung ;
Journal of the Korea Society of Computer and Information, volume 19, issue 7, 2014, Pages 77~85
DOI : 10.9708/jksci.2014.19.7.077
Recently, several environment damage caused by malicious or suspicious code is increasing. We study comprehensive response system actively for malware detection. Suspicious code is installed on your PC without your consent, users are unaware of the damage. Also, there are need to technology for realtime processing of Big Data. We must develope advanced technology for malware detection. We must analyze the static, dynamic of executable file for fundamentally malware detection in recently and verified by a reputation for verification. It is need to judgment of similarity for realtime response with big data. In this paper, we proposed realtime detection and verification technology using multiple filter. Our malware study suggests a new direction of realtime malware detection.
A Study on Definitions of Security Requirements for Identification and Authentication on the Step of Analysis
Shin, Seong-Yoon ;
Journal of the Korea Society of Computer and Information, volume 19, issue 7, 2014, Pages 87~93
DOI : 10.9708/jksci.2014.19.7.087
TIn analysis as the first step of S/W development, security requirements of identification and authentication, ID and password management, authentication process, authentication method, ete. should be defined. Identification is to uniquely identify certain users and applications running on a certain system. Authentication means the function to determine true or false users and applications in some cases. This paper is to suggest the security requirements for identification and authentication in analysis step. Firstly, individual ID should be uniquely identified. The second element is to apply the length limitations, combination and periodic changes of passwords. The third should require the more reinforced authentication methods besides ID and passwords and satisfy the defined security elements on authentication process. In this paper, the security requirements for the step of identification and authentication have been explained through several practical implementation methods.
An Efficient Dynamic Workload Balancing Strategy Design of the Wireless Reading/Management System for the Corrosion Monitoring of Underground Structures
Kwan, Yong-Kwang ;
Journal of the Korea Society of Computer and Information, volume 19, issue 7, 2014, Pages 95~102
DOI : 10.9708/jksci.2014.19.7.095
There are a variety of structures below the surface are buried. In particular, if It is experiencing problems in the city gas pipe or electrical wire, our safety would be greatly jeopardized. Therefore, the underground structures which encounter a variety of pollutants are highly sensitive to corrosion. So if you are not identify the degree of corrosion, it can lead to large accidents such as gas leakage. Until now, person visit directly every underground structure to measure and record manually, but This approach requires a lot of human and material resources and the continuity of management. Therefore, the research to find out the risk factors quickly via the continuous management is needed, and in this paper the structures management systems in the vehicle being moved by combining ICT underground structures for state information wirelessly collects and analyzes system is proposed.
A Point-to-Point Shortest Path Search Algorithm in an Undirected Graph Using Minimum Spanning Tree
Lee, Sang-Un ;
Journal of the Korea Society of Computer and Information, volume 19, issue 7, 2014, Pages 103~111
DOI : 10.9708/jksci.2014.19.7.103
This paper proposes a modified algorithm that improves on Dijkstra's algorithm by applying it to purely two-way traffic paths, given that a road where bi-directional traffic is made possible shall be considered as an undirected graph. Dijkstra's algorithm is the most generally utilized form of shortest-path search mechanism in GPS navigation system. However, it requires a large amount of memory for execution for it selects the shortest path by calculating distance between the starting node and every other node in a given directed graph. Dijkstra's algorithm, therefore, may occasionally fail to provide real-time information on the shortest path. To rectify the aforementioned shortcomings of Dijkstra's algorithm, the proposed algorithm creates conditions favorable to the undirected graph. It firstly selects the shortest path from all path vertices except for the starting and destination vertices. It later chooses all vertex-outgoing edges that coincide with the shortest path setting edges so as to simultaneously explore various vertices. When tested on 9 different undirected graphs, the proposed algorithm has not only successfully found the shortest path in all, but did so by reducing the time by 60% and requiring less memory.
BLOCS: Block Correlation Aware Sequential Pattern Mining based Caching Algorithm for Hybrid Storages
Lee, Seongjin ; Won, Youjip ;
Journal of the Korea Society of Computer and Information, volume 19, issue 7, 2014, Pages 113~130
DOI : 10.9708/jksci.2014.19.7.113
In this paper, we propose BLOCS algorithm to find sequence of data that should be saved in cache device of hybrid storage system which uses SSD as a cache device. BLOCS algorithm which uses a sequence pattern mining scheme, creates a set of frequently requested sectors with respect to requested order of sectors. To compare the performance of the proposed scheme, we introduce Distance (DIST) based scheme, Request Frequency (FREQ) based scheme, and Frequency times Size (F-S) based scheme. We measure the hit ratio and I/O latency of different caching schemes using hybrid storage caching simulator. We acquired booting workload along with ten scenarios of launching applications and use the workloads as input to the cache simulator. After experiment with booting workload, we find that BLOCS scheme gives hit ratio of 61% which is about 15% higher than the least performing DIST scheme.
An Efficient Implementation of Kruskal's Algorithm for A Minimum Spanning Tree
Lee, Ju-Young ;
Journal of the Korea Society of Computer and Information, volume 19, issue 7, 2014, Pages 131~140
DOI : 10.9708/jksci.2014.19.7.131
In this paper, we present an efficient implementation of Kruskal's algorithm to obtain a minimum spanning tree. The proposed method utilizes the union-find data structure, reducing the depth of the tree of the node set by making the nodes in the path to root be the child node of the root of combined tree. This method can reduce the depth of the tree by shortening the path to the root and lowering the level of the node. This is an efficient method because if the tree's depth reduces, it could shorten the time of finding the root of the tree to which the node belongs. The performance of the proposed method is evaluated through the graphs generated randomly. The results showed that the proposed method outperformed the conventional method in terms of the depth of the tree.
Development of Video Watermark System for Low-specification System as Android Platforms
Hwang, Seon-Cheol ;
Journal of the Korea Society of Computer and Information, volume 19, issue 7, 2014, Pages 141~149
DOI : 10.9708/jksci.2014.19.7.141
This paper describes a method to insert and detect watermark or fingerprint to/from videos in low-computing powered system as Android platforms. Fingerprint, which is a kind of watermark, has features such as patterns that contain information. The inserting frame numbers in video-stream and the positions in a picture were chosen from the encrypted user ID to insert the watermarks. The used encrypt algorithm is the HIGHT algorithm which was developed for low-computing powered systems by KISA(Korean Internet & Security Agency). Subtracting an inferred picture from the previous picture was used to extract a candidate feature. Median filtering was used to get rid of noise and stabilize the candidate feature. New algorithm that reduces calculating steps of the median filtering was developed and applied for low-specification systems. The stabilized features were accumulated over 150 times and calculated by correlation coefficient method to recognize the patterns. We examined 22 videos and successfully detected the patterns from 21 videos. The correlation coefficient r values that we examined through this study exceeded over 0.79 more than the threshold (0.7).
A study on the Necessity of the Death Penalty in the Information Society -Focused on the misjudgement cases-
Lee, Dong-Myung ;
Journal of the Korea Society of Computer and Information, volume 19, issue 7, 2014, Pages 151~159
DOI : 10.9708/jksci.2014.19.7.151
Sometimes, the misjudgement of imperfect human can not be avoided because capital punishment is decided by a judicial officer, human. Dreiinstanzen system has been adopted to prevent misjudgement. However the possibility of misjudgement can not be entirely excluded in the judgement by a judicial officer as the judgement of a lower court and a higher tribunal depends on the specific criminal cases. And in case of capital punishment executed by misjudgement, it leads to a cruelty result which has not ways to recover the damage. There is an opinion that dangerousness of misjudgement is lacking in persuasiveness because of insufficient demonstration for the abolition of capital punishment. However, also, there is an opinion that the abolition of capital punishment in case of misjudgement is persuasive with reality. In this case, even if other punishments are discussed separately, once capital punishment is executed, it can be irrevocable unjustice because a nation itself commits a crime. According to this, I would like to find out causes of misjudgement in the criminal justice system through the cases of advanced countries, such as United states, Japan, which are rich in studies and case analysis related to misjudgement, and introduce their efforts to prevent misjudgement in this paper.