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
Guideline for Test Process Improvement of Test Organization Through Correlating TMMi with TPI NEXT
Kim, Kidu ; Park, Young Bom ; Kim, R. Youngchul ;
KIPS Transactions on Software and Data Engineering, volume 2, issue 12, 2013, Pages 823~828
DOI : 10.3745/KTSDE.2013.2.12.823
In this paper, it will improve in quality to adapt a right test process which is formalized from certification of TMMi Level. To do this, we suggest correlative relation through analyzing associations between TMMi and TPI next based on the previous research, which provides the guideline for enhancing test process level with measuring Test maturity model. Also schematize test maturity measurement through refining and improving the previous test maturity correlation metrics[6,8,9]. As one example with limited level, it shows the guideline to improve test process of one testing organization through improved correlation metrics with TMMi and TPI next.
Generating Test Cases of Simulink/Stateflow Model Based on RRT Algorithm Using Heuristic Input Analysis
Park, Hyeon Sang ; Choi, Kyung Hee ; Chung, Ki Hyun ;
KIPS Transactions on Software and Data Engineering, volume 2, issue 12, 2013, Pages 829~840
DOI : 10.3745/KTSDE.2013.2.12.829
This paper proposes a modified RRT (Rapidly exploring Random Tree) algorithm utilizing a heuristic input analysis and suggests a test case generation method from Simulink/Stateflow model using the proposed RRT algorithm. Though the typical RRT algorithm is an efficient method to solve the reachability problem to definitely be resolved for generating test cases of model in a black box manner, it has a drawback, an inefficiency of test case generation that comes from generating random inputs without considering the internal states and the test targets of model. The proposed test case generation method increases efficiency of test case generation by analyzing the test targets to be satisfied at the current state and heuristically deciding the inputs of model based on the analysis during expanding an RRT, while maintaining the merit of RRT algorithm. The proposed method is evaluated with the models of ECUs embedded in a commercial passenger`s car. The performance is compared with that of the typical RRT algorithm.
Design of Efficient Inspection Scope in e-banking System
Park, Hae Yoon ; Yoo, Hae Young ;
KIPS Transactions on Software and Data Engineering, volume 2, issue 12, 2013, Pages 841~848
DOI : 10.3745/KTSDE.2013.2.12.841
Nowadays, the finance changes so rapidly that the time period of developing a e-banking system has been shorter. As a result, the risk of developing in the new e-banking system has increased. Therefore financial institutions constantly ask to review the quality test of their system during the project development. However, from the developer`s point of view, additional system quality inspection will delay the development time for a new project, so financial investors and developers, because this problem will cause conflict. In order to solve this problem, in this paper define priority that considered characteristics of e-banking system and thereby design range priority decision criteria for efficient code inspection. Even in the e-banking system development, it is expected that using newly designed range of code inspection will allow high efficient quality performance.
Visualization Technique of Spatial Statistical Data and System Implementation
Baek, Ryong ; Hong, Gwang-Soo ; Yang, Seung-Hoon ; Kim, Byung-Gyu ;
KIPS Transactions on Software and Data Engineering, volume 2, issue 12, 2013, Pages 849~854
DOI : 10.3745/KTSDE.2013.2.12.849
In this paper, a system technology-based algorithms and visualization is proposed to show a space data. Also the proposed system provides analysis function with combination of usual map and automatic document generation function to give a useful information for making an important decision based on spatial distributed data. In the proposed method, we employ the heat map analysis to present a suitable color distribution for 2 dimensional map data. The buffering analysis method is also used to define the spatial data access. By using the proposed system, spatial information in a variety of distribution will be easy to identify. Also, if we make a use of automatic document generation function in the proposed algorithm, a lot of time and cost savings are expected to make electronic document which representation of spatial information is required.
A Study on the Implementation of SQL Primitives for Decision Tree Classification
An, Hyoung Geun ; Koh, Jae Jin ;
KIPS Transactions on Software and Data Engineering, volume 2, issue 12, 2013, Pages 855~864
DOI : 10.3745/KTSDE.2013.2.12.855
Decision tree classification is one of the important problems in data mining fields and data minings have been important tasks in the fields of large database technologies. Therefore the coupling efforts of data mining systems and database systems have led the developments of database primitives supporting data mining functions such as decision tree classification. These primitives consist of the special database operations which support the SQL implementation of decision tree classification algorithms. These primitives have become the consisting modules of database systems for the implementations of the specific algorithms. There are two aspects in the developments of database primitives which support the data mining functions. The first is the identification of database common primitives which support data mining functions by analysis. The other is the provision of the extended mechanism for the implementations of these primitives as an interface of database systems. In data mining, some primitives want be stored in DBMS is one of the difficult problems. In this paper, to solve of the problem, we describe the database primitives which construct and apply the optimized decision tree classifiers. Then we identify the useful operations for various classification algorithms and discuss the implementations of these primitives on the commercial DBMS. We implement these primitives on the commercial DBMS and present experimental results demonstrating the performance comparisons.
Automatic Construction of Korean Two-level Lexicon using Lexical and Morphological Information
Kim, Bogyum ; Lee, Jae Sung ;
KIPS Transactions on Software and Data Engineering, volume 2, issue 12, 2013, Pages 865~872
DOI : 10.3745/KTSDE.2013.2.12.865
Two-level morphology analysis method is one of rule-based morphological analysis method. This approach handles morphological transformation using rules and analyzes words with morpheme connection information in a lexicon. It is independent of language and Korean Two-level system was also developed. But, it was limited in practical use, because of using very small set of lexicon built manually. And it has also a over-generation problem. In this paper, we propose an automatic construction method of Korean Two-level lexicon for PC-KIMMO from morpheme tagged corpus. We also propose a method to solve over-generation problem using lexical information and sub-tags. The experiment showed that the proposed method reduced over-generation by 68% compared with the previous method, and the performance increased from 39% to 65% in f-measure.
Antecedent Identification of Zero Subjects using Anaphoricity Information and Centering Theory
Kim, Kye-Sung ; Park, Seong-Bae ; Lee, Sang-Jo ;
KIPS Transactions on Software and Data Engineering, volume 2, issue 12, 2013, Pages 873~880
DOI : 10.3745/KTSDE.2013.2.12.873
This paper approaches the problem of resolving Korean zero pronouns using Centering Theory modeling local coherence. Centering Theory has been widely used to resolve English pronouns. However, it is much difficult to apply the centering framework for zero pronoun resolution in languages such as Japanese and Korean. Since in particular the use of non-anaphoric zero pronouns without explicit antecedents is not considered in the Centering Theory of Grosz et al., the presence of non-anaphoric cases negatively affects the performance of the resolution system based on Centering Theory. To overcome this, this paper presents a method which determines the intra-sentential anaphoricity of zero pronouns in subject position by using relationships between clauses, and then identifies antecedents of zero subjects. In our experiments, the proposed method outperforms the baseline method relying solely on Centering Theory.
Construction of an Efficient Pre-analyzed Dictionary for Korean Morphological Analysis
Kwak, Sujeong ; Kim, Bogyum ; Lee, Jae Sung ;
KIPS Transactions on Software and Data Engineering, volume 2, issue 12, 2013, Pages 881~888
DOI : 10.3745/KTSDE.2013.2.12.881
A pre-analyzed dictionary is used to increase the speed and the accuracy of morphological analyzers and to decrease the over-generation. However, if the dictionary includes `Insufficiently-analyzed word-phrases`, which do not include all the possible analysis of the word-phrase, it may cause the decrease of the analysis accuracy. In this paper, we measure the accuracy changes according to the number of word-phrase frequency and the size changes of corpus by Sejong corpus. And performance of integrate system(SMA with pre-dictionary) is highest when sufficient analysis rate of pre-dictionary is more than 99.82%. Also pre-dictionary is constructed with word-phrase that frequency more than 32(64) when size of corpus is 1,600,000(6,300,000) word-phrase.
Counterfeit Money Detection Algorithm based on Morphological Features of Color Printed Images and Supervised Learning Model Classifier
Woo, Qui-Hee ; Lee, Hae-Yeoun ;
KIPS Transactions on Software and Data Engineering, volume 2, issue 12, 2013, Pages 889~898
DOI : 10.3745/KTSDE.2013.2.12.889
Due to the popularization of high-performance capturing equipments and the emergence of powerful image-editing softwares, it is easy to make high-quality counterfeit money. However, the probability of detecting counterfeit money to the general public is extremely low and the detection device is expensive. In this paper, a counterfeit money detection algorithm using a general purpose scanner and computer system is proposed. First, the printing features of color printers are calculated using morphological operations and gray-level co-occurrence matrix. Then, these features are used to train a support vector machine classifier. This trained classifier is applied for identifying either original or counterfeit money. In the experiment, we measured the detection rate between the original and counterfeit money. Also, the printing source was identified. The proposed algorithm was compared with the algorithm using wiener filter to identify color printing source. The accuracy for identifying counterfeit money was 91.92%. The accuracy for identifying the printing source was over 94.5%. The results support that the proposed algorithm performs better than previous researches.
Three Dimensional Visualization of Contact Region for a Protein Complex
Kang, Beom Sik ; Kim, Ku-Jin ; Kim, Yukyeong ;
KIPS Transactions on Software and Data Engineering, volume 2, issue 12, 2013, Pages 899~902
DOI : 10.3745/KTSDE.2013.2.12.899
In this paper, we present a method to visualize the contact region between two molecules in a protein complex in a threedimensional space. The contact region of two molecules shows compatibility in geometric aspects. Usually, the computation of the area of contact region has been used to show the strength of compatibility. The numerical value and simple drawing of contact region would be useful for comparing the relative strength of different contacts, but it is not appropriate for analysing the geometric characteristics of the contact region. In this paper, we present a method to show the compatibility between two molecules by visualizing the distance information between them.