Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
KIPS Transactions on Software and Data Engineering
Journal Basic Information
Journal DOI :
Korea Information Processing Society
Editor in Chief :
Volume & Issues
Volume 2, Issue 12 - Dec 2013
Volume 2, Issue 11 - Nov 2013
Volume 2, Issue 10 - Oct 2013
Volume 2, Issue 9 - Sep 2013
Volume 2, Issue 8 - Aug 2013
Volume 2, Issue 7 - Jul 2013
Volume 2, Issue 6 - Jun 2013
Volume 2, Issue 5 - May 2013
Volume 2, Issue 4 - Apr 2013
Volume 2, Issue 3 - Mar 2013
Volume 2, Issue 2 - Feb 2013
Volume 2, Issue 1 - Jan 2013
Selecting the target year
MADA Feedback Framework for Adaptive Inference Results of Situation Aware Services in Mobile Environments
Shin, Soohye ; Park, Joonseok ; Yeom, Keunhyuk ;
KIPS Transactions on Software and Data Engineering, volume 2, issue 7, 2013, Pages 443~450
DOI : 10.3745/KTSDE.2013.2.7.443
The high portability and mobility of mobile devices have given rise to critical concerns with regard to mobile situation-aware services that utilize user situation information in the mobile domain. Mobile situation-aware services for mobile devices are provided by collecting and analyzing data, from which the user situation is inferred through an inference system. However, the high mobility of the mobile domain has made it difficult to infer the required results. In addition, previous studies have not identified a systematic approach to modifying and adapting. In this paper, we propose a systematic feedback process model based on software cybernetics in order to address the abovementioned problems. Further, we propose a MADA(Monitoring, Analysis, Determinating, Adaptation) framework for the feedback process model. Thus, the proposed approach supports the development of self-adaptive mobile situation-aware services that can infer appropriate results and manage the inferred results systematically.
Automated Test Data Generation for Dynamic Branch Coverage
Chung, In Sang ;
KIPS Transactions on Software and Data Engineering, volume 2, issue 7, 2013, Pages 451~460
DOI : 10.3745/KTSDE.2013.2.7.451
In order to achieve high test coverage, it is usual to generate test data using various techniques including symbolic execution, data flow analysis or constraints solving. Recently, a technique for automated test data generation that fulfills high coverage effectively without those sophisticated means has been proposed. However, the technique shows its weakness in the generation of test data that leads to high coverage for programs having branch conditions where different memory locations are binded during execution. For certain programs with flag conditions, in particular, high coverage can not be achieved because specific branches are not executed. To address the problem, this paper presents dynamic branch coverage criteria and a test data generation technique based on the notion of dynamic branch. It is shown that the proposed technique compared to the previous approach is more effective by conducting experiments involving programs with flag conditions.
Traceability Management Technique for Software Artifacts which Comprise Software Release
Kim, Dae Yeob ; Youn, Cheong ;
KIPS Transactions on Software and Data Engineering, volume 2, issue 7, 2013, Pages 461~470
DOI : 10.3745/KTSDE.2013.2.7.461
The capacity for tracing relationships among various artifacts which are created at each phase of software system development is essential for software quality management. Software release refers to delivering a set of newly created or changed artifacts to customers. The relationships among artifacts which comprise software release must be traced so that the work for customer`s requirement of change and functional enhancement is effectively established. And release management can be effectively realized through the integration of configuration management and change management. This paper proposes the technique for supporting change management of artifacts and for tracing relationships of artifacts which comprise software release through the integrated environment of personal workspace and configuration management system. In the proposed environment, the visualized version graph and automated tagging function are used for tracing relationships of artifacts.
Test-case Generation for Simulink/Stateflow Model using a Separated RRT Space
Park, Hyeon Sang ; Choi, Kyung Hee ; Chung, Ki Hyun ;
KIPS Transactions on Software and Data Engineering, volume 2, issue 7, 2013, Pages 471~478
DOI : 10.3745/KTSDE.2013.2.7.471
This paper proposes a black-box based test case generation method for Simulink/Stateflow model utilizing the RRT algorithm which is a method to efficiently solve the path planning for complicated systems. The proposed method in the paper tries to solve the reachability problem with the RRT algorithm, which has to be solved for black-box based test case generations. A major problem of the RRT based test case generation algorithms is that the cost such as running time and required memory size is too much for complicated Stateflow model. The typical RRT algorithm expands rapidly-exploring random tree (RRT) in a single state space. But the proposed method expands it in dynamic state space based on the state of Simulink model, consequently reducing the cost. In the paper, a new definition of RRT state space, a distance measure and a test case generation algorithm are proposed. The performance of proposed method is verified through the experiment against Stateflow model.
A Study on Elicitation Procedures of the Entity for Data Model
Kim, Doyu ; Yeo, Jeongmo ;
KIPS Transactions on Software and Data Engineering, volume 2, issue 7, 2013, Pages 479~486
DOI : 10.3745/KTSDE.2013.2.7.479
The data model that can be said as skeleton of the information system constitutes important 2 axles in the information system together with the process model. There is entity, properties, relation as key factors of the data model, and entity is the most fundamental factor in the data model, and thus total data model becomes vague if not deriving entity definitely. This study dealt with entity deduction only. Deducing methods of existing entity depended on experiences, task knowledge of designers and clear procedures were not suggested, so there were many difficulties in approaching them from beginners or unskilled persons. For giving helps in solving the problem, this study proposes entity- deducing procedures based on tasks that can derive entity with a systematic process at previously derived target businesses through suggested methods from advancing researches. And the study enabled proposing procedures on imaginary tasks to be applied, objecting to undergraduates who had not experiences on the data modeling, and then verified suggesting process through a similarity checking between best answers with deduced entity by students after taking impossible points of comparing existing methods with suggesting process into consideration. By doing so, deducing entity closely to the best answer was confirmed accordingly. Therefore, a fact could be confirmed that beginners were able to deduce entity closely to the best answer even if letting beginners who had not experiences on the data modeling be applied to unfamiliar tasks. Regarding researches on properties and relation deduction besides entity, this study leaves them to next time.
Fuzzy Clustering Based Medical Image Watermarking
Alamgir, Nyma ; Kim, Jong-Myon ;
KIPS Transactions on Software and Data Engineering, volume 2, issue 7, 2013, Pages 487~494
DOI : 10.3745/KTSDE.2013.2.7.487
Medical image watermarking has received extensive attention as wide security services in the healthcare information system. This paper proposes a blind medical image watermarking approach on the segmented gray-matter (GM) images by utilizing discrete wavelet transform (DWT) and discrete cosine transform (DCT) along with enhanced suppressed fuzzy C-means (EnSFCM) for the optimal selection of sub-blocks position to insert a watermark. Experimental results show that the proposed approach outperforms other methods in terms of peak signal to noise ratio (PSNR) and M-SVD. In addition, the proposed approach shows better robustness than other methods in normalized correlation (NC) values against several attacks, such as noise addition, filtering, JPEG compression, blurring, histogram equalization, and cropping.
Fast Hierarchical Search Method for Multi-view Video Coding
Yoon, Hyo-Sun ; Kim, Mi-Young ;
KIPS Transactions on Software and Data Engineering, volume 2, issue 7, 2013, Pages 495~502
DOI : 10.3745/KTSDE.2013.2.7.495
Motion estimation (ME) that limits the performance of image quality and encoding speed has been developed to reduce temporal redundancy in video sequences and plays an important role in digital video compression. But it is computational demanding part of the encoder. Multi-view video is obtained by capturing one three-dimensional scene with many cameras at different positions. ME for Multi-view video requires high computational complexity. To reduce computational complexity and maintain the image quality, a fast motion estimation method is proposed in this paper. The proposed method uses a hierarchical search strategy. This strategy method consists of modified diamond search patten, multi gird diamond search pattern, and raster search pattern. These search patterns place search points symmetrically and evenly that can cover the overall search area not to fall into the local minimum or exploits the characteristics of the distribution of motion vectors to place the search points. Experiment results show that the speedup improvement of the proposed method over TZ search method (JMVC) can be up to 1.2 ~3 times faster while maintaining similar video quality and bit rates.
Preprocessing and Facial Feature Robust to Illumination Variations
Kim, Dong-Ju ; Lee, Sang-Heon ; Kim, Hyun-Duk ;
KIPS Transactions on Software and Data Engineering, volume 2, issue 7, 2013, Pages 503~506
DOI : 10.3745/KTSDE.2013.2.7.503
In this paper, we propose the face recognition method combining the ECSP preprocessing technique which is modified version of previous CS-LBP and the illumination-robust D2D-PCA feature. The performance evaluation of proposed method was carried out using various binary pattern operators and feature extraction algorithms such as well-known PCA and 2D-PCA on the Yale B database. As a results, the proposed method showed the best recognition accuracy compared to different approaches, and we confirmed that the proposed approach is robust to illumination variation.