Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
The KIPS Transactions:PartD
Journal Basic Information
Journal DOI :
Korea Information Processing Society
Editor in Chief :
Volume & Issues
Volume 13D, Issue 7 - Dec 2006
Volume 13D, Issue 6 - Oct 2006
Volume 13D, Issue 5 - Oct 2006
Volume 13D, Issue 4 - Aug 2006
Volume 13D, Issue 3 - Jun 2006
Volume 13D, Issue 2 - Apr 2006
Volume 13D, Issue 1 - Feb 2006
Selecting the target year
Frequent Itemset Creation using Bit Transaction Clustering in Data Mining
Kim Eui-Chan ; Hwang Byung-Yeon ;
The KIPS Transactions:PartD, volume 13D, issue 3, 2006, Pages 293~298
DOI : 10.3745/KIPSTD.2006.13D.3.293
Many data are stored in database. For getting any information from many data, we use the query sentences. These information is basic and simple. Data mining method is various. In this paper, we manage clustering and association rules. We present a method for finding the better association rules, and we solve a problem of the existing association rules. We propose and apply a new clustering method to fit for association rules. It is not clustering of the existing distance basis or category basis. If we find association rules of each clusters, we can get not only existing rules found in all transaction but also rules that will be characteristics of clusters. Through this study, we can expect that we will reduce the number of many transaction access in large databases and find association of small group.
Semi-Automatic Ontology Generation about XML Documents using Data Mining Method
Gu Mi-Sug ; Hwang Jeong-Hee ; Ryu Keun-Ho ; Hong Jang-Eui ;
The KIPS Transactions:PartD, volume 13D, issue 3, 2006, Pages 299~308
DOI : 10.3745/KIPSTD.2006.13D.3.299
As recently XML is becoming the standard of exchanging web documents and public documentations, XML data are increasing in many areas. To retrieve the information about XML documents efficiently, the semantic web based on the ontology is appearing. The existing ontology has been constructed manually and it was time and cost consuming. Therefore in this paper, we propose the semi-automatic ontology generation technique using the data mining technique, the association rules. The proposed method solves what type and how many conceptual relationships and determines the ontology domain level for the automatic ontology generation, using the data mining algorithm. Appying the association rules to the XML documents, we intend to find out the conceptual relationships to construct the ontology, finding the frequent patterns of XML tags in the XML documents. Using the conceptual ontology domain level extracted from the data mining, we implemented the semantic web based on the ontology by XML Topic Maps (XTM) and the topic map engine, TM4J
Concept Extraction Technique from Documents Using Domain Ontology
Mun Hyeon-Jeong ; Woo Yong-Tae ;
The KIPS Transactions:PartD, volume 13D, issue 3, 2006, Pages 309~316
DOI : 10.3745/KIPSTD.2006.13D.3.309
We propose a novel technique to categorize XML documents and extract a concept efficiently using domain ontology. First, we create domain ontology that use text mining technique and statistical technique. We propose a DScore technique to classify XML documents by using the structural characteristic of XML document. We also present TScore technique to extract a concept by comparing the association term set of domain ontology and the terms in the XML document. To verify the efficiency of the proposed technique, we perform experiment for 295 papers in the computer science area. The results of experiment show that the proposed technique using the structural information in the XML documents is more efficient than the existing technique. Especially, the TScore technique effectively extract the concept of documents although frequency of term is few. Hence, the proposed concept-based retrieval techniques can be expected to contribute to the development of an efficient ontology-based knowledge management system.
Design and Implementation of XML Indexing and Query Scheme Based on Database Concept Structure
Choo Kyo-Nam ; Woo Yo-Seob ;
The KIPS Transactions:PartD, volume 13D, issue 3, 2006, Pages 317~324
DOI : 10.3745/KIPSTD.2006.13D.3.317
In this paper, we propose a new indexing technique to solve various queries which have a strong good point not only database indexing schema take advantage of converting from semi-structured data to structured data but also performance is more faster than before. We represent structure information of XML document between nodes of tree that additional numbering information which can be bit-stream without modified structure of XML tree. And, We add in indexing schema searching incidental structure information in the process. In Querying schema, we recover ancestor nodes through give information of node using indexing schema in complete path query expression as well as relative path query expression. Therefore, it takes advantage of making derivative query expression with given query. In this process, we recognize that indexing and querying schema can get searched result set faster and more accurate. Because response time is become shorter by bit operating, when query occur and it just needs information of record set earch node in database.
Design & Performance Evaluation of Storage and Index Structures for Spatial Network Databases
Um Jung-Ho ; Chang Jae-Woo ;
The KIPS Transactions:PartD, volume 13D, issue 3, 2006, Pages 325~336
DOI : 10.3745/KIPSTD.2006.13D.3.325
For supporting LBS service, recent studies on spatial network databases (SNDB) have been done actively. In order to gain good performance on query processing in SNDB, we, in this paper. design efficient storage and index structures for spatial network data, point of interests (POIs), and moving objects on spatial networks. First, we design a spatial network file organization for maintaining the spatial network data itself consisting of both node and edges. Secondly, we design a POI storage and index structure which is used for gaining fast accesses to POIs, like restaurant, hotel, and gas station. Thirdly, we design a signature-based storage and index structure for efficiently maintaining past, current, and expected future trajectory information of moving objects. Finally, we show that the storage and index structures designed in this paper outperform the existing storage structures for spatial networks as well as the conventional trajectory index structures for moving objects.
Similar Trajectory Retrieval on Road Networks using Spatio-Temporal Similarity
Hwang Jung-Rae ; Kang Hye-Young ; Li Ki-Joune ;
The KIPS Transactions:PartD, volume 13D, issue 3, 2006, Pages 337~346
DOI : 10.3745/KIPSTD.2006.13D.3.337
In order to analyze the behavior of moving objects, a measure for determining the similarity of trajectories needs to be defined. Although research has been conducted that retrieved similar trajectories of moving objects in Euclidean space, very little research has been conducted on moving objects in the space defined by road networks. In terms of real applications, most moving objects are located in road network space rather than in Euclidean space. In similarity measure between trajectories, however, previous methods were based on Euclidean distance and only considered spatial similarity. In this paper, we define similarity measure based on POI and TOI in road network space. With this definition, we present methods to retrieve similar trajectories using spatio-temporal similarity between trajectories. We show clustering results for similar trajectories. Experimental results show that similar trajectories searched by each method and consistency rate between each method for the searched trajectories.
Pattern Similarity Retrieval of Data Sequences for Video Retrieval System
Lee Seok-Lyong ;
The KIPS Transactions:PartD, volume 13D, issue 3, 2006, Pages 347~356
DOI : 10.3745/KIPSTD.2006.13D.3.347
A video stream can be represented by a sequence of data points in a multidimensional space. In this paper, we introduce a trend vector that approximates values of data points in a sequence and represents the moving trend of points in the sequence, and present a pattern similarity matching method for data sequences using the trend vector. A sequence is partitioned into multiple segments, each of which is represented by a trend vector. The query processing is based on the comparison of these vectors instead of scanning data elements of entire sequences. Using the trend vector, our method is designed to filter out irrelevant sequences from a database and to find similar sequences with respect to a query. We have performed an extensive experiment on synthetic sequences as well as video streams. Experimental results show that the precision of our method is up to 2.1 times higher and the processing time is up to 45% reduced, compared with an existing method.
On Extending the Prefix-Querying Method for Efficient Time-Series Subsequence Matching Under Time Warping
Chang Byoung-Chol ; Kim Sang-Wook ; Cha Jae-Hyuk ;
The KIPS Transactions:PartD, volume 13D, issue 3, 2006, Pages 357~368
DOI : 10.3745/KIPSTD.2006.13D.3.357
This paper discusses the way of processing time-series subsequence matching under time warping. Time warping enables finding sequences with similar patterns even when they are of different lengths. The prefix-querying method is the first index-based approach that performs time-series subsequence matching under time warping without false dismissals. This method employs the
as a base distance function for allowing users to issue queries conveniently. In this paper, we extend the prefix-querying method for absorbing
, which is the most-widely used as a base distance function in time-series subsequence matching under time warping, instead of
. We also formally prove that the proposed method does not incur any false dismissals in the subsequence matching. To show the superiority of our method, we conduct performance evaluation via a variety of experiments. The results reveal that our method achieves significant performance improvement in orders of magnitude compared with previous methods.
Accelerating the EM Algorithm through Selective Sampling for Naive Bayes Text Classifier
Chang Jae-Young ; Kim Han-Joon ;
The KIPS Transactions:PartD, volume 13D, issue 3, 2006, Pages 369~376
DOI : 10.3745/KIPSTD.2006.13D.3.369
This paper presents a new method of significantly improving conventional Bayesian statistical text classifier by incorporating accelerated EM(Expectation Maximization) algorithm. EM algorithm experiences a slow convergence and performance degrade in its iterative process, especially when real online-textual documents do not follow EM`s assumptions. In this study, we propose a new accelerated EM algorithm with uncertainty-based selective sampling, which is simple yet has a fast convergence speed and allow to estimate a more accurate classification model on Naive Bayesian text classifier. Experiments using the popular Reuters-21578 document collection showed that the proposed algorithm effectively improves classification accuracy.
K Partition-Based Even Wear-Leveling Policy for Flash Memory
Park Je-Ho ;
The KIPS Transactions:PartD, volume 13D, issue 3, 2006, Pages 377~382
DOI : 10.3745/KIPSTD.2006.13D.3.377
Advantageous features of flash memory are stimulating its exploitation in mobile and ubiquitous related devices. The hardware characteristics of flash memory however place restrictions upon this current trend. In this paper, a cleaning policy for flash memory is proposed in order to decrease the necessary penally for recycling of memory minimizing the degradation of performance at the same time. The proposed cleaning algorithm is based on partitioning of candidate memory regions, to be reclaimed as free, into a number of groups. In addition, in order to improve the balanced utilization of the entire flash memory space in terms of `wearing-out`, a free segment selection algorithm is discussed. The impact of the proposed algorithms is evaluated through a number of experiments. Moreover, the composition of the optimal configuration featuring the proposed methods is tested through experiments.
A MDA-based Approach to Developing UI Architecture for Mobile Telephony Software
Lee Joon-Sang ; Chae Heung-Seok ;
The KIPS Transactions:PartD, volume 13D, issue 3, 2006, Pages 383~390
DOI : 10.3745/KIPSTD.2006.13D.3.383
Product-line engineering is a dreaming goal in software engineering research. Unfortunately, the current underlying technologies do not seem to be still not much matured enough to make it viable in the industry. Based on our experiences in working on mobile telephony systems over 3 years, now we are in the course of developing an approach to product-line engineering for mobile telephony system software. In this paper, the experiences are shared together with our research motivation and idea. Consequently, we propose an approach to building and maintaining telephony application logics from the perspective of scenes. As a Domain-Specific Language(DSL), Menu Navigation Viewpoint(MNV) DSL is designed to deal with the problem domain of telephony applications. The functional requirements on how a set of telephony application logics are configured can be so various depending on manufacturer, product concept, service carrier, and so on. However, there is a commonality that all of the currently used telephony application logics can be generally described from the point of user`s view, with a set of functional features that can be combinatorially synthesized from typical telephony services(i.e. voice/video telephony, CBS/SMS/MMS, address book, data connection, camera/multimedia, web browsing, etc.), and their possible connectivity. MNV DSL description acts as a backbone software architecture based on which the other types of telephony application logics are placed and aligned to work together globally.
Verification of Deployment Algorithms in Wireless Mobile Sensor Networks using SPIN
Oh Dong-Jin ; Park Jae-Hyun ;
The KIPS Transactions:PartD, volume 13D, issue 3, 2006, Pages 391~398
DOI : 10.3745/KIPSTD.2006.13D.3.391
This paper verifies deployment algorithms in wireless sensor networks using SPIN, a widely used model checking tool. In this paper, two deployment algorithms, DSSA(Distributed Self Spreading Algorithm) and TBDA(Tree Based Deployment Algorithm), are verified to check their stability against oscillation as well as energy consumption that is an important factor in wireless sensor networks.
Design and Implementation of PS-Block Timing Model Using PS-Block Structue
Kim Yun-Kwan ; Shin Won ; Chang Chun-Hyon ; Kim Tae-Wan ;
The KIPS Transactions:PartD, volume 13D, issue 3, 2006, Pages 399~404
DOI : 10.3745/KIPSTD.2006.13D.3.399
A real-time system is used for various systems from small embedded systems to distributed enterprise systems. Because it has a characteristic that provides a service on time, developers should make efforts to keep this property about time when developing real-time applications. As the result of research about real-time system indicates, TMO model supports various functions for time processing according to the real-time concept. And it guarantees response time which developers defined. So developers need a point of reference to define deadline and check the correctness of time. This paper proposes an improved PS-Block as an infrastructure of analysis tools for TMO to present a point of reference. There is a problem that the existing PS-Block has overhead caused by a policy making duplicated blocks. As such, this paper implements a PS-Block Timing Model to reduce the overhead due to block duplication, and defines a base class for searching in PS-Block. The PS-Block Timing Model, using an improved PS-Block structure, offers a point of reference of deadline and an infrastructure of execution time analysis according to the PS-Block configuration policy. Therefore, TMO developers can easily verify deadline of real-time methods, and improve reliability, and reduce development terms.
A Study on the ITSM and CSC working together for effective business process
Choi Byung-Hoon ; Kim Sang-Geun ;
The KIPS Transactions:PartD, volume 13D, issue 3, 2006, Pages 405~414
DOI : 10.3745/KIPSTD.2006.13D.3.405
These days, business environments are rapidly change and companies are taking the pressure about a customer value enhance to the continuance from the market. Therefore companies propel various innovative and strategic initiatives for a customer value enhancement. Also Information Technology is rapidly becoming part of our everyday lives due to its fast development, the functions and responsibilities of CSC(Consolidated Service Center) are undergoing revolutionary change. The function of sales organization based on the manpower and human networks are gradually shrinking, and CSC is slowly establishing itself as the company`s core parts as its function expands and its operations are in the spotlights. Among these, many organizations are currently introducing ITSM concept for primary processes as a means of achieving synergy in operational excellence, reducing costs and improving service quality. In this thesis, we propose an extended CSC, which is applied ITIL Process to traditional BMP. It also needs to manage more effectively business process model, to modeling rapidly changing business process, and to developing its business application programs whenever and whatever it is changed. The ITSM(IT Service Management), which is an ITIL tool, effectively managing for dynamically changing the business process.
Applying 6 sigma techniques in CMMI based software process improvement
Kim Han-Saem ; Han Hyuk-Soo ;
The KIPS Transactions:PartD, volume 13D, issue 3, 2006, Pages 415~424
DOI : 10.3745/KIPSTD.2006.13D.3.415
There are increasing numbers of foreign and domestic organizations that are using CMM/CMMI to establish their processes and keep improving them. CMMI and IDEAL models of SEI provide the best practices of processes and guide the organization using them based on processes maturity levels. However, they do not deal with their tools or methods that describe how to implement the processes in the organization. Therefore, in this paper, we developed a method in which various tools and statistical methodology of 6 sigma are applied to identify the process areas to be improved, to extract problems in those areas and to prioritize them. We expect this paper can contribute to the organizations that are searching for practical way of implementing CMMI based software process improvement and of identifying improvement items systematically. Also this method will be used to understand the result of improvement activities quantitatively.
An Adaptative Learning System by using SCORM-Based Dynamic Sequencing
Lee Jong-Keun ; Kim Jun-Tae ; Kim Hyung-Il ;
The KIPS Transactions:PartD, volume 13D, issue 3, 2006, Pages 425~436
DOI : 10.3745/KIPSTD.2006.13D.3.425
The e-learning system in which the learning is carried out by predefined procedures cannot offer proper learning suitable to the capability of individual learner. To solve this problem, SCORM sequencing can be used to define various learning procedures according to the capabilities of learners. Currently the sequencing is designed by teachers or learning contents producers to regularize the learning program. However, the predefined sequencing may not reflect the characteristics of the learning group. If inappropriate sequencing is designed it may cause the unnecessary repetition of learning. In this paper, we propose an automated evaluation system in which dynamic sequencing is applied. The dynamic sequencing reflects the evaluation results to the standard scores used by sequencing. By changing the standard scores, the sequencing changes dynamically according to the evaluation results of a learning group. Through several experiments, we verified that the proposed learning system that uses the dynamic sequencing is effective for providing the proper learning procedures suitable to the capabilities of learners.
Design and Implementation of a Improved Cipher Web Mail System using a Chaos Cipher
Kim Dae-Young ; Kim Tae-Sik ;
The KIPS Transactions:PartD, volume 13D, issue 3, 2006, Pages 437~444
DOI : 10.3745/KIPSTD.2006.13D.3.437
A chaos cipher system that focuses on the stream cipher system has a demerit that the longer the text is, the slower the speed of the encryption and description and the transmission and reception. On this study, we designed the cipher web mail system showing much better capabilities than the existing web mail system as the text is longer. In the embodiment of the cipher web mail system, we developed the key stream, the encryption and description of the text and the inside and outside mail viewer and so on. After the efficiency test, it was valued high in the respect of the speed of the encryption and description and the transmission and reception. And it made up for the defect of the stream cipher system. We expect that we can use it through the persistent applied study in the server system security, the file security, the security of the internet information, the protection of the e-commerce system information and other fields based on the cipher technique as the wide use cipher system that can replace the block cipher system.
Implementation of An Embedded Communication Translator for Remote Control
Lee Byung-Kwon ; Chon Young-Suk ; Jeon Joong-Nam ;
The KIPS Transactions:PartD, volume 13D, issue 3, 2006, Pages 445~454
DOI : 10.3745/KIPSTD.2006.13D.3.445
Almost of industrial measuring instruments usually are equipped only with serial communication devices. In order to connect these instruments to internet, we implement an embedded translator. This device has the hardware components composed of one WAN port, two LAN ports, and two UARTs, and functions as a communication translator between serial and internet communication. it also provides web-based monitoring function that is absent from existing serial-to-ethernet converter. The hardware is implemented using the KS8695 network processor which s an ARM922T as processor core. We have installed the boa web server and utilized the CGI function for internet-based remote control, added the IP sharing function which allows the network with private IP addresses to access the internet, and developed a serial-to-ethernet translation program. Finally, we show an application example of the developed translator that remotely monitors the solar energy production system.