Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
KIISE Transactions on Computing Practices
Journal Basic Information
Journal DOI :
Korean Institute of Information Scientists and Engineers
Editor in Chief :
Volume & Issues
Volume 21, Issue 12 - Dec 2015
Volume 21, Issue 11 - Nov 2015
Volume 21, Issue 10 - Oct 2015
Volume 21, Issue 9 - Sep 2015
Volume 21, Issue 8 - Aug 2015
Volume 21, Issue 7 - Jul 2015
Volume 21, Issue 6 - Jun 2015
Volume 21, Issue 5 - May 2015
Volume 21, Issue 4 - Apr 2015
Volume 21, Issue 3 - Mar 2015
Volume 21, Issue 2 - Feb 2015
Volume 21, Issue 1 - Jan 2015
Selecting the target year
A Study on the Detection of Small Arm Rifle Sound Using the Signal Modelling Method
Shin, Mincheol ; Park, Kyusik ;
KIISE Transactions on Computing Practices, volume 21, issue 7, 2015, Pages 443~451
DOI : 10.5626/KTCP.2015.21.7.443
This paper proposes a signal modelling method that can effectively detect the shock wave(SW) sound and muzzle blast(MB) sound from the gunshot of a small arm rifle. In order to localize a counter sniper in battlefield, an accurate detection of both shock wave sound and muzzle blast sound are the necessary keys in estimating the direction and the distance of the counter sniper. To verify the performance of the proposed algorithm, a real gunshot sound in a domestic military shooting range was recorded and analyzed. From the experimental results, the proposed signal modelling method was found to be superior to the comparative system more than 20% in a shock wave detection and 5% in a muzzle blast detection, respectively.
SQUERY : A Spatial Query Processor with Spatial Reasoning and Geometric Computation
Kim, Jongwhan ; Kim, Incheol ;
KIISE Transactions on Computing Practices, volume 21, issue 7, 2015, Pages 452~457
DOI : 10.5626/KTCP.2015.21.7.452
In this paper, we propose a spatial query processor, SQUERY, which can derive rich query results through spatial reasoning on the initial knowledge base, as well as, process both qualitative and quantitative queries about the topological and directional relationships between spatial objects. In order to derive richer query results, the query processor expands the knowledge base by applying forward spatial reasoning into the initial knowledge base in a preprocessing step. The proposed query processor uses not only qualitative spatial knowledge describing topological/directional relationship between spatial objects, but also utilizes quantitative spatial knowledge including geometric data of individual spatial objects through geometric computation. The results of an experiment with the OSM(Open Street Map) spatial knowledge base demonstrates the high performance of our spatial query processing system.
Dynamic Adaptive Streaming over HTTP with Buffer Based Opportunistic Control of Energy Communication Mode
Kim, Seohyang ; Oh, Hayoung ; Kim, Chongkwon ;
KIISE Transactions on Computing Practices, volume 21, issue 7, 2015, Pages 458~463
DOI : 10.5626/KTCP.2015.21.7.458
These days, streaming users are using ABR (Adaptive Bitrate) technique services by requesting the most adequate video rate selectively based on their own channel states. Most ABR related video rate adaptation techniques are only focused on real-time bitrate adaptations based on their own channel state, and misses energy limited characteristics that come from a mobile device's battery dependence. In other words, the mobile device's important characteristics and accompanying energy consumption are not being considered and causes dissatisfaction over streaming services. In this paper, we propose energy efficient prefetching based dynamic adaptive video streaming techniques, which saves unnecessary consumed energy while providing video rates of the same performance. Our scheme continuously turns off energy modules with enough streaming in the buffer and turns on in case of the opposite situation to save energy. Through the performance evaluation, this study's proposed scheme is 60% better than the previous work at global average mobile download speed.
A Search for Analogous Patients by Abstracting the Results of Arrhythmia Classification
Park, Juyoung ; Kang, Kyungtae ;
KIISE Transactions on Computing Practices, volume 21, issue 7, 2015, Pages 464~469
DOI : 10.5626/KTCP.2015.21.7.464
Long-term electrocardiogram data can be acquired by linking a Holter monitor to a mobile phone. However, most systems are designed to detect arrhythmia through heartbeat classification, and not just for supporting clinical decisions. In this paper, we propose an Abstracting algorithm, and introduce an analogous pateint search system using this algorithm. An analogous patient searcher summarizes each patient's typical pattern using the results of heartbeat, which can greatly simplify clinical activity. It helps to find patients with similar arrhythmia patterns, which can help in contributing to diagnostic clues. We have simulated these processes on data from the MIT-BIH arrhythmia database. As a result, the Abstracting algorithm provided a typical pattern to assist in reaching rapid clinical decisions for 64% of the patients. On an average, typical patterns and results generated by the abstracting algorithm summarized the results of heartbeat classification by 98.01%.
Design of OpenStack Cloud Storage Systems - Applying Infiniband Storage Network and Storage Virtualization Performance Evaluation
Heo, Hui-Seong ; Lee, Kwang-Soo ; Pirahandeh, Mehdi ; Kim, Deok-Hwan ;
KIISE Transactions on Computing Practices, volume 21, issue 7, 2015, Pages 470~475
DOI : 10.5626/KTCP.2015.21.7.470
Openstack is an open source software that enables developers to build IaaS(Infrastructure as a Service) cloud platforms. Openstack can virtualize servers, networks and storages, and provide them to users. This paper proposes the structure of Openstack cloud storage system applying Infiniband to solve bottlenecking that may occur between server and storage nodes when the server performs an I/O operation. Furthermore, we implement all flash array based high-performance Cinder storage volumes which can be used at Nova virtual machines by applying distributed RAID-60 structures to three 8-bay SSD storages and show that Infiniband storage networks applied to Openstack is suitable for virtualizing high-performance storage.
Parallelization of CUSUM Test in a CUDA Environment
Son, Changhwan ; Park, Wooyeol ; Kim, HyeongGyun ; Han, KyungSook ; Pyo, Changwoo ;
KIISE Transactions on Computing Practices, volume 21, issue 7, 2015, Pages 476~481
DOI : 10.5626/KTCP.2015.21.7.476
We have parallelized the cumulative sum (CUSUM) test of NIST's statistical random number test suite in a CUDA environment. Storing random walks in an array instead of in scalar variables eliminates data dependence. The change in data structure makes it possible to apply parallel scans, scatters, and reductions at each stage of the test. In addition, serial data exchanges between CPU and GPU are removed by migrating CPU's tasks to GPU. Finally we have optimized global memory accesses. The overall speedup is 23 times over the sequential version. Our results contribute to improving security of random numbers for cryptographic keys as well as reducing the time for evaluation of randomness.
Analysis on Correlation between Prescriptions and Test Results of Diabetes Patients using Graph Models and Node Centrality
Yoo, Kang Min ; Park, Sungchan ; Rhee, Su-jin ; Yu, Kyung-Sang ; Lee, Sang-goo ;
KIISE Transactions on Computing Practices, volume 21, issue 7, 2015, Pages 482~487
DOI : 10.5626/KTCP.2015.21.7.482
This paper presents the results and the process of extracting correlations between events of prescriptions and examinations using graph-modeling and node centrality measures on a medical dataset of 11,938 patients with diabetes mellitus. As the data is stored in relational form, RDB2Graph framework was used to construct effective graph models from the data. Personalized PageRank was applied to analyze correlation between prescriptions and examinations of the patients. Two graph models were constructed: one that models medical events by each patient and another that considers the time gap between medical events. The results of the correlation analysis confirm current medical knowledge. The paper demonstrates some of the note-worthy findings to show the effectiveness of the method used in the current analysis.
A Converting Method to Simulate DEVS Models on AddSIM
Kim, Dohyung ; Oh, Hyunshik ; Park, Juhye ; Park, Samjoon ;
KIISE Transactions on Computing Practices, volume 21, issue 7, 2015, Pages 488~493
DOI : 10.5626/KTCP.2015.21.7.488
An AddSIM(Adaptive distributed and parallel Simulation environment for Interoperable and reusable Models) is an integrated engagement simulation environment with high-resolution weapon system models for estimation and analysis of their performance and effectiveness. AddSIM can simultaneously handle the continuous dynamical system models based on continuous time, and command, control(C2) and network system models based on a discrete event. To accommodate legacies based on DEVS(Discrete Event System Specification) modeling, DEVS legacies must first be converted into AddSIM models. This paper describes how to implement DEVS models on AddSIM. In this study a method of mapping from hierarchical DEVS models to AddSIM players was developed: The hierarchical DEVS model should be flattened into a one layered model and four DEVS functions of the model, external transition, internal transition, output and time advance, should be mapped into functions of the AddSIM player.
An Efficient Clustering Method based on Multi Centroid Set using MapReduce
Kang, Sungmin ; Lee, Seokjoo ; Min, Jun-ki ;
KIISE Transactions on Computing Practices, volume 21, issue 7, 2015, Pages 494~499
DOI : 10.5626/KTCP.2015.21.7.494
As the size of data increases, it becomes important to identify properties by analyzing big data. In this paper, we propose a k-Means based efficient clustering technique, called MCSKMeans (Multi centroid set k-Means), using distributed parallel processing framework MapReduce. A problem with the k-Means algorithm is that the accuracy of clustering depends on initial centroids created randomly. To alleviate this problem, the MCSK-Means algorithm reduces the dependency of initial centroids using sets consisting of k centroids. In addition, we apply the agglomerative hierarchical clustering technique for creating k centroids from centroids in m centroid sets which are the results of the clustering phase. In this paper, we implemented our MCSK-Means based on the MapReduce framework for processing big data efficiently.
Word Sense Disambiguation of Predicate using Sejong Electronic Dictionary and KorLex
Kang, Sangwook ; Kim, Minho ; Kwon, Hyuk-chul ; Jeon, SungKyu ; Oh, Juhyun ;
KIISE Transactions on Computing Practices, volume 21, issue 7, 2015, Pages 500~505
DOI : 10.5626/KTCP.2015.21.7.500
The Sejong Electronic(machine readable) Dictionary, which was developed by the 21 century Sejong Plan, contains a systematic of immanence information of Korean words. It helps in solving the problem of electronical presentation of a general text dictionary commonly used. Word sense disambiguation problems can also be solved using the specific information available in the Sejong Electronic Dictionary. However, the Sejong Electronic Dictionary has a limitation of suggesting structure of sentences and selection-restricted nouns. In this paper, we discuss limitations of word sense disambiguation by using subcategorization information as suggested by the Sejong Electronic Dictionary and generalize selection-restricted noun of argument using Korean Lexico-semantic network.
Design and Implementation of a Physical Network Separation System using Virtual Desktop Service based on I/O Virtualization
Kim, Sunwook ; Kim, Seongwoon ; Kim, Hakyoung ; Chung, Seongkwon ; Lee, Sookyoung ;
KIISE Transactions on Computing Practices, volume 21, issue 7, 2015, Pages 506~511
DOI : 10.5626/KTCP.2015.21.7.506
IOV is a technology that supports one or more virtual desktops, and can share a single physical device. In general, the virtual desktop uses the virtual IO devices which are provided by virtualization SW, using SW emulation technology. Virtual desktops that use the IO devices based on SW emulation have a problem in which service quality and performance are declining. Also, they cannot support the high-end application operations such as 3D-based CAD and game applications. In this paper, we propose a physical network separation system using Virtual Desktop Service based on HW direct assignments to overcome these problems. The proposed system provides independent desktops that are used to access the intranet or internet using server virtualization technology in a physical desktop computer for the user. In addition, this system can also support a network separation without network performance degradation caused by inspection of the network packet for logical network separations and additional installations of the desktop for physical network separations.