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 15D, Issue 6 - Dec 2008
Volume 15D, Issue 5 - Oct 2008
Volume 15D, Issue 4 - Aug 2008
Volume 15D, Issue 3 - Jun 2008
Volume 15D, Issue 2 - Apr 2008
Volume 15D, Issue 1 - Feb 2008
Selecting the target year
Efficient Evaluation of Shared Predicates for XForms Page Access Control
Lee, Eun-Jung ;
The KIPS Transactions:PartD, volume 15D, issue 4, 2008, Pages 441~450
DOI : 10.3745/KIPSTD.2008.15-D.4.441
Recently, access control on form-based web information systems has become one of the useful methods for implementing client systems in a service-oriented architecture. In particular, XForms language is being adopted in many systems as a description language for XML-based user interfaces and server interactions. In this paper, we propose an efficient algorithm for the evaluation of XPath-based access rules for XForms pages. In this model, an XForms page is a sequence of queries and the client system performs user interface realization along with XPath rule evaluations. XPath rules have instance-dependent predicates, which for the most part are shared between rules. For the efficient evaluation of shared predicate expressions in access control rules, we proposed a predicate graph model that reuses the previously evaluated results for the same context node. This approach guarantees that each predicate expression is evaluated for the relevant xml node only once.
Active Adjustment: An Approach for Improving the Search Performance of the TPR
Kim, Sang-Wook ; Jang, Min-Hee ; Lim, Sung-Chae ;
The KIPS Transactions:PartD, volume 15D, issue 4, 2008, Pages 451~462
DOI : 10.3745/KIPSTD.2008.15-D.4.451
Recently, with the advent of applications using locations of moving objects, it becomes crucial to develop efficient index schemes for spatio-temporal databases. The
-tree is most popularly accepted as an index structure for processing future-time queries. In the
-tree, the future locations of moving objects are predicted based on the CBR(Conservative Bounding Rectangle). Since the areas predicted from CBRs tend to grow rapidly over time, CBRs thus enlarged lead to serious performance degradation in query processing. Against the problem, we propose a new method to adjust CBRs to be tight, thereby improving the performance of query processing. Our method examines whether the adjustment of a CBR is necessary when accessing a leaf node for processing a user query. Thus, it does not incur extra disk I/Os in this examination. Also, in order to make a correct decision, we devise a cost model that considers both the I/O overhead for the CBR adjustment and the performance gain in the future-time owing to the CBR adjustment. With the cost model, we can prevent unusual expansions of BRs even when updates on nodes are infrequent and also avoid unnecessary execution of the CBR adjustment. For performance evaluation, we conducted a variety of experiments. The results show that our method improves the performance of the original
Image recommendation algorithm based on profile using user preference and visual descriptor
Kim, Deok-Hwan ; Yang, Jun-Sik ; Cho, Won-Hee ;
The KIPS Transactions:PartD, volume 15D, issue 4, 2008, Pages 463~474
DOI : 10.3745/KIPSTD.2008.15-D.4.463
Approximation of Frequent Itemsets with Maximum Size by One-scan for Association Rule Mining Application
Han, Gab-Soo ;
The KIPS Transactions:PartD, volume 15D, issue 4, 2008, Pages 475~484
DOI : 10.3745/KIPSTD.2008.15-D.4.475
Nowadays, lots of data mining applications based on continuous and online real time are increasing by the rapid growth of the data processing technique. In order to do association rule mining in that application, we have to use new techniques to find the frequent itemsets. Most of the existing techniques to find the frequent itemsets should scan the total database repeatedly. But in the application based on the continuous and online real time, it is impossible to scan the total database repeatedly. We have to find the frequent itemsets with only one scan of the data interval for that kind of application. So in this paper we propose an approximation technique which finds the maximum size of the frequent itemsets and items included in the maximum size of the frequent itemsets for the processing of association rule mining.
Clustering of Web Objects with Similar Popularity Trends
Loh, Woong-Kee ;
The KIPS Transactions:PartD, volume 15D, issue 4, 2008, Pages 485~494
DOI : 10.3745/KIPSTD.2008.15-D.4.485
Huge amounts of various web items such as keywords, images, and web pages are being made widely available on the Web. The popularities of such web items continuously change over time, and mining temporal patterns in popularities of web items is an important problem that is useful for several web applications. For example, the temporal patterns in popularities of search keywords help web search enterprises predict future popular keywords, enabling them to make price decisions when marketing search keywords to advertisers. However, presence of millions of web items makes it difficult to scale up previous techniques for this problem. This paper proposes an efficient method for mining temporal patterns in popularities of web items. We treat the popularities of web items as time-series, and propose gapmeasure to quantify the similarity between the popularities of two web items. To reduce the computation overhead for this measure, an efficient method using the Fast Fourier Transform (FFT) is presented. We assume that the popularities of web items are not necessarily following any probabilistic distribution or periodic. For finding clusters of web items with similar popularity trends, we propose to use a density-based clustering algorithm based on the gap measure. Our experiments using the popularity trends of search keywords obtained from the Google Trends web site illustrate the scalability and usefulness of the proposed approach in real-world applications.
Regression Testing of Software Evolution by AOP
Lee, Mi-Jin ; Choi, Eun-Man ;
The KIPS Transactions:PartD, volume 15D, issue 4, 2008, Pages 495~504
DOI : 10.3745/KIPSTD.2008.15-D.4.495
Aspect Oriented Programming(AOP) is a relatively new programming paradigm and has properties that other programming paradigms don`t have. This new programming paradigm provides new modularization of software systems by cross-cutting concerns. In this paper, we propose a regression test method for program evolution by AOP. By using JoinPoint, we can catch a pointcut-name which makes it possible to test the incorrect pointcut strength fault and the incorrect aspect precedence fault. Through extending proof rules to aspect, we can recognize failures to establish expected postconditions faults. We can also trace variables using set() and get() pointcut and test failures to preserve state invariant fault. Using control flow graph, we can test incorrect changes in control dependencies faults. In order to show the correctness of our proposed method, channel management system is implemented and tested by using proposed methods.
A Single Requirement Modeling with Graphical Language for Embedded System
Oh, Jung-Sup ; Lee, Hong-Seok ; Park, Hyun-Sang ; Kim, Jang-Bok ; Choi, Kyung-Hee ; Jung, Ki-Hyun ;
The KIPS Transactions:PartD, volume 15D, issue 4, 2008, Pages 505~512
DOI : 10.3745/KIPSTD.2008.15-D.4.505
In order to do requirement-based testing of embedded system, we must have correct requirement specifications. But, natural language requirements of a client have ambiguity, inaccuracy, and inconsistency. To solve these problems, natural language requirements are modeled with modeling language such as UML and Simulink. During a modeling phase, the requirements are rearranged and retranslated in use-case. These activities are disadvantages of modeling. In this paper, we propose the technique, which is how to model a embedded system requirement into a model without rearranging and retranslating. This technique 1) represent a embedded system requirement with graphical language, and 2) model a requirement into a model. Because this technique only describes "what-to-do" of the requirement, this technique is useful to not only the low-level requirements but also the high-level requirements. We show some example systems modeled by REED, which has adopted this technique.
A Practical Process Model for Clients in Service-Oriented Architecture
Lee, Jae-Yoo ; Kim, Soo-Dong ;
The KIPS Transactions:PartD, volume 15D, issue 4, 2008, Pages 513~522
DOI : 10.3745/KIPSTD.2008.15-D.4.513
Service-Oriented Architecture(SOA) is an method to develop applications by developing and publishing reusable services which potentially be used in various applications, and discovering and composing right services dynamically. SOA adopts a paradigm of publish-discover-invoke, which is considerably different from object-oriented and component-based development(CBD) approaches. The service in SOA is different from function in procedural programming, object in object-oriented programming, and component in CBD, and its fundamental requirement is a high level of reusability and applicability. In SOA, service providers and service consumers are loosely coupled since the providers try to develop reusable services and the consumers try to locate right services without knowing much about the providers and their published services. Moreover, the process of searching, choosing and invoking right services is not presented in conventional programming paradigms. Therefore, conventional approaches to developing user interfaces and invoking the functionality on servers through JSP, and RMI in object-oriented programming cannot well be applicable to designing clients’ programs in SOA. Therefore, there is a high demand for a practical and systematic process for developing clients’ applications, and the such a process should be devised by considering key characteristics of services and SOA. However, little work on this area is known to date, and there has not a process for client side just except few guide lines for developing service client. In this paper, we propose a practical and systematic development process for developing clients` applications in SOA. Then, we define instructions for carrying out each activity in the process. To show the applicability of the proposed work, we show the result of applying our process in developing a services application for searching and booking hotels.
A Study for Process Improvement by State Analysis of Risk Items
Lee, Eun-Ser ;
The KIPS Transactions:PartD, volume 15D, issue 4, 2008, Pages 523~530
DOI : 10.3745/KIPSTD.2008.15-D.4.523
There are many defects that cause the process improvement of lifecycle problems during software development. This paper propose the management method of risk items that removes and manages the lifecycle problems as well. For the similar projects, we can estimate defects and prepare to solve them by using domain expert knowledge and the state analysis of defect items, which can greatly improve the software process. This research provides solution of management of risk items problem and detection of defect transition and its prevention and causes that happen on software development. Also, In this paper propose to making quantity of degree and transition phase.
Adaptive Random Testing through Iterative Partitioning with Enlarged Input Domain
Shin, Seung-Hun ; Park, Seung-Kyu ;
The KIPS Transactions:PartD, volume 15D, issue 4, 2008, Pages 531~540
DOI : 10.3745/KIPSTD.2008.15-D.4.531
An Adaptive Random Testing(ART) is one of test case generation algorithms, which was designed to get better performance in terms of fault-detection capability than that of Random Testing(RT) algorithm by locating test cases in evenly spreaded area. Two ART algorithms, such as Distance-based ART(D-ART) and Restricted Random Testing(RRT), had been indicated that they have significant drawbacks in computations, i.e., consuming quadratic order of runtime. To reduce the amount of computations of D-ART and RRT, iterative partitioning of input domain strategy was proposed. They achieved, to some extent, the moderate computation cost with relatively high performance of fault detection. Those algorithms, however, have yet the patterns of non-uniform distribution in test cases, which obstructs the scalability. In this paper we analyze the distribution of test cases in an iterative partitioning strategy, and propose a new method of input domain enlargement which makes the test cases get much evenly distributed. The simulation results show that the proposed one has about 3 percent of improvement in terms of mean relative F-measure for 2-dimension input domain, and shows 10 percent improvement for 3-dimension space.
A Development of GVP for Hierarchical POI Information Visualization based on GML
Song, Eun-Ha ; Park, Yong-Jin ; Jeong, Young-Sik ;
The KIPS Transactions:PartD, volume 15D, issue 4, 2008, Pages 541~548
DOI : 10.3745/KIPSTD.2008.15-D.4.541
Today, GIS service requires not only a simple map visualization but also geographical information of each object. However, POI service provides simply geographical naming service only because of lacking in geographical information of objects. In addition, geographical space data representation functioning that is the basis for most GIS has not been standardized yet. In this paper, it is designed that POI DB that is hierarchical and user-oriented and it is constructed that GVP(GML Viewer POI) that is the basis of GML specification to overcome difference and incompatibility of map visualization. GVP adds POI DB in a 3-Layer structure to dBase file managing the information of SHP file attributes. Therefore, POI visualization enables hierarchical search, by providing POI information in directory-type grouping. Consisting of map visualization and POI visualization, GVP regenerates attributes in the form of individual objects and responds to user events immediately.
A Persistence Framework Based SQL
Cho, Dongil-Il ; Rhew, Sung-Yul ;
The KIPS Transactions:PartD, volume 15D, issue 4, 2008, Pages 549~556
DOI : 10.3745/KIPSTD.2008.15-D.4.549
Web-based Enterprise Intranet System is developed Object-oriented programming language and data management is constructed using RDBMS. Between Object-oriented programming language and RDBMS bring about "Object-Relational Impedance Mismatch" due to heterogeneous paradigm. To solve this kinds of problems commonly use the ORM Framework that it is converting data between incompatible type systems in databases and object-oriented programming languages, uses complex mapping metadata. It causes difficult to develop and maintain because of inflexible in changes. This paper proposed persistence framework that solve the existing complexity of ORM framework and has more flexible in evolution of database table. This persistence framework is unnecessary meta information that connecting with entity of database table and the objects, it offers users convenience of maintenance and it allows far more flexible and affordable systems to be built because of automatically code generation. The result of testing based on the proposed persistence framework with Hibernate, iBATIS, It is similar response time with iBATIS and it has more about three times faster than Hibernate. But iBATIS has problems of mass data processing.
An ontology analysis and error detection tool based on concept hierarchy structures
Hwang, Suk-Hyung ;
The KIPS Transactions:PartD, volume 15D, issue 4, 2008, Pages 557~568
DOI : 10.3745/KIPSTD.2008.15-D.4.557
An ontology as the core element of Semantic Web is a formal specification of a conceptualization of shared domain knowledge. The use of well-defined ontologies can increase the quality of interoperable information systems in the area of Semantic Web. However, in practice, it is not easy to develop high-quality ontologies which have no errors. Therefore, with methodologies for ontology design, various methods or tools for ontology analysis supporting for error-detection might be very helpful for ontology developers. In this paper, we propose a novel approach for analyzing the core constructs of ontology based on the Formal Concept Analysis and develop a tool that supports error-checking ontologies. Our approach can serve not only as a guidance to modify the existing ontologies, but also as a valuable tool in developing high-quality ontologies.
A Fusion System of WS-BPEL and OWL-S for Semi-Automatic Composition of Web Services
Lee, Yong-Ju ;
The KIPS Transactions:PartD, volume 15D, issue 4, 2008, Pages 569~580
DOI : 10.3745/KIPSTD.2008.15-D.4.569
Web services are the current most promising technology for service oriented architecture(SOA) implementations. However, in spite of the large scale acceptance of web services, they have been relegated to internal integration projects, and the grand vision of virtual enterprises where partners can be integrated on demand is yet to be realized. The main reason is that the current standards of web services are not very suitable for the dynamic web service discovery and integration. In this paper, we present a novel SemanticBPEL solution that merges the benefit of WS-BPEL, with the advantage of OWL-S for building a semi-automatic web service composition system. In particular, this work proposes a multi-phase search method for solving dynamic discovery and integration problems of web services. The proposed method is compared with the existing keyword based retrieval method. These comparisons show that our approach outperforms the existing method.
Image Feature based Inpainting Scheme for Restoration of Line Scratch of Old Film
Ko, Ki-Hong ; Kim, Seong-Whan ;
The KIPS Transactions:PartD, volume 15D, issue 4, 2008, Pages 581~588
DOI : 10.3745/KIPSTD.2008.15-D.4.581
Old films or photographs usually have damages from physical or chemical effects, and the damage and digitalization make stain, scratch, scribbling, noise, and digital drop out in frames. Damages include global damage and local damage, and it is well known that local damage restoration is a main factor for improving image quality. Previous researches have focused on impairment localization (esp. for line scratch impairments) and restoration techniques for line scratch, dirt, blob, and intentional scratch. Inpainting is a key technique using partial derivatives to restore damages in images. It does not show good quality for the complex images because it is based on finite order for partial derivatives, and it takes much time complexity. In this paper, we present a modified inpainting scheme, where we use Sobel edge operator`s and angle to compute isophotes, and compare our scheme with Bertalmio`s scheme. We experiment our scheme with two old Korean films, and Simulation results show that our scheme requires smaller time complexity than Bertalmio`s scheme with comparable reconstructed image quality.