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 12D, Issue 7 - Dec 2005
Volume 12D, Issue 6 - Dec 2005
Volume 12D, Issue 5 - Oct 2005
Volume 12D, Issue 4 - Aug 2005
Volume 12D, Issue 3 - Jun 2005
Volume 12D, Issue 2 - Apr 2005
Volume 12D, Issue 1 - Feb 2005
Selecting the target year
Mining Frequent Closed Sequences using a Bitmap Representation
Kim Hyung-Geun ; Whang Whan-Kyu ;
The KIPS Transactions:PartD, volume 12D, issue 6, 2005, Pages 807~816
DOI : 10.3745/KIPSTD.2005.12D.6.807
Sequential pattern mining finds all of the frequent sequences satisfying a minimum support threshold in a large database. However, when mining long frequent sequences, or when using very low support thresholds, the performance of currently reported algorithms often degrades dramatically. In this paper, we propose a novel sequential pattern algorithm using only closed frequent sequences which are small subset of very large frequent sequences. Our algorithm generates the candidate sequences by depth-first search strategy in order to effectively prune. using bitmap representation of underlying databases, we can effectively calculate supports in terms of bit operations and prune sequences in much less time. Performance study shows that our algorithm outperforms the previous algorithms.
Efficient Mining of Frequent Itemsets in a Sparse Data Set
Park In-Chang ; Chang Joong-Hyuk ; Lee Won-Suk ;
The KIPS Transactions:PartD, volume 12D, issue 6, 2005, Pages 817~828
DOI : 10.3745/KIPSTD.2005.12D.6.817
The main research problems in a mining frequent itemsets are reducing memory usage and processing time of the mining process, and most of the previous algorithms for finding frequent itemsets are based on an Apriori-property, and they are multi-scan algorithms. Moreover, their processing time are greatly increased as the length of a maximal frequent itemset. To overcome this drawback, another approaches had been actively proposed in previous researches to reduce the processing time. However, they are not efficient on a sparse .data set This paper proposed an efficient mining algorithm for finding frequent itemsets. A novel tree structure, called an
-tree, was proposed int, and an efficient mining algorithm of frequent itemsets using
-tree, called an
-traverse algorithm was also proposed. An
-tree is constructed from
, i.e., a set of frequent itemsets of size 2, and an
-traverse algorithm can find its mining result in a short time by traversing the
-tree once. To reduce the processing more, this paper also proposed an optimized algorithm
-traverse, which removes previously an itemset in
not to be a frequent itemsets of size 3. Through various experiments, it was verified that the proposed algorithms were efficient in a sparse data set.
Splitting Rules using Intervals for Object Classification in Image Databases
Cho, June-Suh ; Choi, Joon-Soo ;
The KIPS Transactions:PartD, volume 12D, issue 6, 2005, Pages 829~836
DOI : 10.3745/KIPSTD.2005.12D.6.829
The way to assign a splitting criterion for correct object classification is the main issue in all decisions trees. This paper describes new splitting rules for classification in order to find an optimal split point. Unlike the current splitting rules that are provided by searching all threshold values, this paper proposes the splitting rules that we based on the probabilities of pre assigned intervals. Our methodology provides that user can control the accuracy of tree by adjusting the number of intervals. In addition, we applied the proposed splitting rules to a set of image data that was retrieved by parameterized feature extraction to recognize image objects.
The Consistency Assessment of Topological Relationships For a Collapse Operator in Multi-Scale Spatial Databases
Kang Hae-Kyong ; Li Ki-Joune ;
The KIPS Transactions:PartD, volume 12D, issue 6, 2005, Pages 837~848
DOI : 10.3745/KIPSTD.2005.12D.6.837
A multi-scale database is a set of spatial database, covering same geographic area with different scales and it can be derived from pre-existing databases. In the derivation processes of a new multi-scale spatial database, the geometries and topological relations on the source database can be transformed and the transformation can be the cause of the lack of integrity Therefore, it is necessary to assess the transformation whether it is consistent or not after the derivation process of a new multi-scale database. Thus, we propose assessment methods for the topological consistency between a source database and a derived multi-scale database in this paper. In particular, we focus on the case that 2-dimensional objects are collapsed to 1-dimensional ones in the derivation process of a multi-scale database. We also describe implementation of the assessment methods and show the results of the implementation with experimental data.
XFormsGen:XForms-Based Automatic UI Code Generator
Lee Eunjung ; Kim Tae-Hun ;
The KIPS Transactions:PartD, volume 12D, issue 6, 2005, Pages 849~856
DOI : 10.3745/KIPSTD.2005.12D.6.849
As XML is more proliferate as a data type between internet programs, automatic generation methods of user input form interfaces get more attention. Recently, generating user interfaces for web application or web service clients become very popular. In this paper, we study the method of automatic generation for XForms-based user interface codes based on XML structure definitions in DTD. With the repetitive edit action model, we present a formal generation method of Input form codes and the overall user interface pages. For the generated code is using XForms as a target language, the result is clear and efficient with the MVC structure. Also, we have developed XFormsGen system which implements the proposed method over the Orbeon presentation server.
Development of Architecture Products Management System
Choi, Nam-Yong ; Song, Young-Jae ;
The KIPS Transactions:PartD, volume 12D, issue 6, 2005, Pages 857~862
DOI : 10.3745/KIPSTD.2005.12D.6.857
MND(Ministry of National Defense) has developed MND AF(Ministry of National Defense Architecture Framework) and CADM(Core Architecture Data Model to guarantee interoperability among defense information systems. But, it is very difficult to manage architecture product documented through MND AF and CADM. So, there Is necessity for development of modeling tool and repository system which can develop architecture products and manage architecture product informations in common repository In this paper, we developed architecture product management system which supports development and management of meta model and architecture product of MND AF and CADM. Through architecture product management system architect of each agency can construct architecture product in a more effective and efficient way with modeling method and a user can search and refer useful architecture product informations using query function. Also, architecture product management system provides the basis for system integration and interoperability with integration, analysis and comparison of architecture product.
Definition of Step Semantics for Hierarchical State Machine based on Flattening
Park, Sa-Choun ; Kwon, Gi-Hwon ; Ha, Soon-Hoi ;
The KIPS Transactions:PartD, volume 12D, issue 6, 2005, Pages 863~868
DOI : 10.3745/KIPSTD.2005.12D.6.863
Hardware and software codesign framework called PeaCE(Ptolemy extension as a Codesign Environment) was developed. It allows to express both data flow and control flow which is described as fFSM which extends traditional finite state machine. While the fFSM model provides lots of syntactic constructs for describing control flow, it has a lack of their formality and then difficulties in verifying the specification. In order to define the formal semantics of the fFSM, in this paper, firstly the hierarchical structure in the model is flattened and then the step semantics is defined. As a result, some important bugs such as race condition, ambiguous transition, and circulartransition can be formally detected in the model.
Construction of MATLAB API for Fuzzy Expert System Determining Automobile Warranty Coverage
Lee, Sang-Hyoun ; Kim, Chul-Min ; Kim, Byung-Ki ;
The KIPS Transactions:PartD, volume 12D, issue 6, 2005, Pages 869~874
DOI : 10.3745/KIPSTD.2005.12D.6.869
In the recent years there has been an increase of service competition in the activity of product selling, especially in the extension of warranty coverage and qualify. The variables in connection with the service competition are not crisp, and required the expertise of the production line. It thus becomes all the more necessary to use subtler tools as decision supports. These problems are typical not only of product companies but also of financial organizations, credit institutions, insurance, which need predictions of credibility for firms or persons in which they have any kind of interest. A suitable approach for minimizing the risk is to use a knowledge-based system. Most often expert systems are not standalone programs, but are embedded into a larger application. The aim of this paper is to discuss an approach for developing an embedded fuzzy expert system with respect to the product selling policy, especially to present the decision system of automobile selling activity around the extension of warranty coverage and quality. We use the MATLAB tools which integrates computation, visualization, and programming in an easy-to-use environment where problems and solutions are expressed in familiar mathematical notation. Also, we present the API functions embedding into the existing application.
Web Services System Supporting Fault-Tolerance based on the Quality
Lee, Yong-Pyo ; Shin, Jae-Dong ; Han, Sang-Yong ;
The KIPS Transactions:PartD, volume 12D, issue 6, 2005, Pages 875~880
DOI : 10.3745/KIPSTD.2005.12D.6.875
Recently web services ale being used to provide environments of distributed computing. Web services provide reusable software component. So, one web service can be used by many users, and one user can use different web services. For reliable use of web services, in these cases, it is important to be fault-tolerance. Existing fault-tolerant methods in web services need a kind of client modification and cannot consider extensible factors like quality. This study suggests the system architecture and description language for the system which can improve some of these problems.
An Ontology Editor to describe the semantic association about Web Documents
Lee Moo-Hun ; Cho Hynu-Kyu ; Cho Hyeon-Sung ; Cho Sung-Hoon ; Jang Chang-Bok ; Choi Eui-In ;
The KIPS Transactions:PartD, volume 12D, issue 6, 2005, Pages 881~888
DOI : 10.3745/KIPSTD.2005.12D.6.881
As the internet continues to grow, the quantity of information on the Web increases beyond measure. The internet users` abilities and requirements to use information also become varied and complicated. Ontology can describe correct meaning of web resource and relationships between web resources. And it can extract conformable information that a user wants. Accordingly, we need the ontology to represent knowledge. W3C announced OWL(Web Ontology Language), a meaning description technology for such web resources. But, the development of a professional use of tools that can compose and edit effectively is not yet developed adequately. In this paper, we design and implement an Ontology editor which generates and edits OWL documents through intuitional interface, with a OWL parser, a Internal DataModel, and a Serializer.
Discovery and Execution Techniques of Semantic Web Services for Dynamic Web Services Composition
Lee Yong-ju ;
The KIPS Transactions:PartD, volume 12D, issue 6, 2005, Pages 889~898
DOI : 10.3745/KIPSTD.2005.12D.6.889
Recently, one of the most challenging problems is to compose web services dynamically, that is, on demand. A number of researchers have been considerably interested in the dynamic web services composition. However, while most of them focused on the semi-automatic web services composition with a human controller, very little attention was devoted to the full automation of this process. This paper primarily focuses on the automatic web services composition techniques. The main idea is to implement an automatic web services composition system using web ontologies to realize the semantic web and workflow technologies to play a major role in E-businesses. In this paper, we propose a matching algorithm for web service discovery and present an approach based on the use of ontologies to facilitate the interoperability of web services. Finally, we describe a workflow execution plan to support the automatic web services composition, and an experimental study that shows the high performance of our system.
An Adaptive Customization Service using Emotional Indices of Bio-rhythm based on Web
Na, Yun-Ji ; Ko, Il-Seok ;
The KIPS Transactions:PartD, volume 12D, issue 6, 2005, Pages 899~904
DOI : 10.3745/KIPSTD.2005.12D.6.899
Necessity of the service-on-demand that reflect a personal characteristic of a customer was increased by an aggravation of web service competition. So a study on a customization is being performed actively. The common customization system supporting of the personalization is performed through the computational data like individual characteristic or preference. Various studies on the service that used emotional information were performed. But we can`t use this emotional information in the web system because of characteristics of emotional information system In this study, we design the adaptive customization system that used emotional information of the customer and analyse the system by experiments.
Suggestion of Healthcare Home Service System Based on Distributed Object Group Framework
Jang Jae-Ho ; Jeong Chang-Won ; Shin Chang-Sun ; Joo Su-Chong ;
The KIPS Transactions:PartD, volume 12D, issue 6, 2005, Pages 905~914
DOI : 10.3745/KIPSTD.2005.12D.6.905
This paper suggests a healthcare home service system based on the distributed object group framework that can not only provide healthcare application services using the information obtained from the physical healthcare sensors and devices, and but also monitor and control these services remotely. The distributed object group framework supports the object group service, the interaction service between object groups and the real-time service in order to execute the healthcare application. Here object group means the unit of logical grouped objects or healthcare sensors and devices for a service. Our suggested system consists of 3 layers. The first layer presents the physical sensors and devices for healthcare, as a physical layer. The second layer lays the distributed object group framework, and the third layer, the upper`s one, implements healthcare applications based on lower layers. With healthcare applications providing for this system, we implemented the location tracking service, the health information service and the titrating environment service. Also the integrated executing results of these services can be monitored and controlled via remote desktop systems or PDAs.
Building B2B system using timestamp tree for data change detection in low speed network environment
Son Sei-Il ; Kim Heung-Jun ;
The KIPS Transactions:PartD, volume 12D, issue 6, 2005, Pages 915~920
DOI : 10.3745/KIPSTD.2005.12D.6.915
In this paper we expanded a existing web based B2B system to support users in low speed network. To guarantee shared dat a consistency between clients and a server, we proposed a method of data change detection by using a time stamp tree and the performance analysis of the proposed method was proved by a simulation. Under the worst condition that leaf nodes of a times tamp tree were changed uniform distribution, the simulation result showed that the proposed method was more efficient than a sequential detection until the percentage of changed nodes were below
. According to our observation, the monthly average of data change was below
on a web-based construction MRO B2B system or a company A from April 2004 to August 2004. Therefore the Proposed method improved performance of data change detection in practice. The proposed method also reduced storage consumption in a server because it didn`t require a server to store replicated data for every client.
Development of a general purpose molecular simulation system from microscopic to mesoscopic scales
Oh, Kwang-Jin ;
The KIPS Transactions:PartD, volume 12D, issue 6, 2005, Pages 921~930
DOI : 10.3745/KIPSTD.2005.12D.6.921
In this paper, a general purpose molecular simulation system which has been developed by the author, are described. One of the most advantageous features is that the molecular simulation system can handle a coarse-grained model as well as an all-atom mode. Therefore, we can simulate mesoscopic phenomena as well as microscopic phenomena with the help of Langevin dynamics simulation and dissipative particle dynamics simulation techniques. Thus we could study anesthesia, protein folding, biopolymer flow in microchannel with single framework, which spans from microscopic to mesoscopic scales. We expect that we can also simulate many other bio/nano systems of technological importance which are not feasible by means of molecular dynamics simulation technique. Finally, performance data are shown and a bottleneck is identified for future optimization.