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
Mining Maximal Frequent Contiguous Sequences in Biological Data Sequences
Kang, Tae-Ho ; Yoo, Jae-Soo ;
The KIPS Transactions:PartD, volume 15D, issue 2, 2008, Pages 155~162
DOI : 10.3745/KIPSTD.2008.15-D.2.155
Biological sequences such as DNA sequences and amino acid sequences typically contain a large number of items. They have contiguous sequences that ordinarily consist of hundreds of frequent items. In biological sequences analysis(BSA), a frequent contiguous sequence search is one of the most important operations. Many studies have been done for mining sequential patterns efficiently. Most of the existing methods for mining sequential patterns are based on the Apriori algorithm. In particular, the prefixSpan algorithm is one of the most efficient sequential pattern mining schemes based on the Apriori algorithm. However, since the algorithm expands the sequential patterns from frequent patterns with length-1, it is not suitable for biological dataset with long frequent contiguous sequences. In recent years, the MacosVSpan algorithm was proposed based on the idea of the prefixSpan algorithm to significantly reduce its recursive process. However, the algorithm is still inefficient for mining frequent contiguous sequences from long biological data sequences. In this paper, we propose an efficient method to mine maximal frequent contiguous sequences in large biological data sequences by constructing the spanning tree with the fixed length. To verify the superiority of the proposed method, we perform experiments in various environments. As the result, the experiments show that the proposed method is much more efficient than MacosVSpan in terms of retrieval performance.
WT-Heuristics: An Efficient Filter Operator Ordering Technology in Stream Data Environments
Min, Jun-Ki ;
The KIPS Transactions:PartD, volume 15D, issue 2, 2008, Pages 163~170
DOI : 10.3745/KIPSTD.2008.15-D.2.163
Due to the proliferation of the Internet and intranet, a new application domain called stream data processing has emerged. Stream data is real-timely and continuously generated. In this paper, we focus on the processing of stream data whose characteristics vary unpredictably by over time. Particularly, we suggest a method which generates an efficient operator execution order called WT-Heuristics. WT-Heuristics efficiently determines the operator execution order since it considers only two adjacent operators in the operator execution order. Also, our method changes the execution order with respect to the change of data characteristics with minimum overheads.
An Indexing System for Retrieving Similar Paths in XML Documents
Lee, Bum-Suk ; Hwang, Byung-Yeon ;
The KIPS Transactions:PartD, volume 15D, issue 2, 2008, Pages 171~178
DOI : 10.3745/KIPSTD.2008.15-D.2.171
Since the XML standard was introduced by the W3C in 1998, documents that have been written in XML have been gradually increasing. Accordingly, several systems have been developed in order to efficiently manage and retrieve massive XML documents. BitCube-a bitmap indexing system-is a representative system for this field of research. Based on the bitmap indexing technique, the path bitmap indexing system(LH06), which performs the clustering of similar paths, improved the problem that the existing BitCube system could not solve, namely, determining similar paths. The path bitmap indexing system has the advantage of a higher retrieval speed in not only exactly matched path searching but also similar path searching. However, the similarity calculation algorithm of this system has a few particular problems. Consequently, it sometimes cannot calculate the similarity even though some of two paths have extremely similar relationships; further, it results in an increment in the number of meaningless clusters. In this paper, we have proposed a novel method that clustering, the similarity between the paths in order to solve these problems. The proposed system yields a stable result for clustering, and it obtains a high score in clustering precision during a performance evaluation against LH06.
Discovery of Frequent Sequence Pattern in Moving Object Databases
Vu, Thi Hong Nhan ; Lee, Bum-Ju ; Ryu, Keun-Ho ;
The KIPS Transactions:PartD, volume 15D, issue 2, 2008, Pages 179~186
DOI : 10.3745/KIPSTD.2008.15-D.2.179
The converge of location-aware devices, GIS functionalities and the increasing accuracy and availability of positioning technologies pave the way to a range of new types of location-based services. The field of spatiotemporal data mining where relationships are defined by spatial and temporal aspect of data is encountering big challenges since the increased search space of knowledge. Therefore, we aim to propose algorithms for mining spatiotemporal patterns in mobile environment in this paper. Moving patterns are generated utilizing two algorithms called All_MOP and Max_MOP. The first one mines all frequent patterns and the other discovers only maximal frequent patterns. Our proposed approach is able to reduce consuming time through comparison with DFS_MINE algorithm. In addition, our approach is applicable to location-based services such as tourist service, traffic service, and so on.
An Efficiency Analysis of Management System for Academy Affairs Process Based on MDA
Yoon, Jung-Mo ; Kim, Chi-Ho ;
The KIPS Transactions:PartD, volume 15D, issue 2, 2008, Pages 187~196
DOI : 10.3745/KIPSTD.2008.15-D.2.187
The system development approach method of the new paradigm, as being standardizing MDA(Model Driven Architecture) in OMG(Object Management Group), the core technique of MDA definite technique structure for system materialization focusing on Model, is to build the design and the statement for system in PIM(Platform Independent Model), Materialization technique, and to build PSM(Platform Specific Model) adapt to materialization environment, and then to be the technique transforming into language Platform suitable to materialization environment. It includes MOF(Meta-Object Facility), UML, XMI(XML Metadata Interchange), CWM(Common Warehouse Metamodel), the core of MDA. Though these operations MDA support automatic tools product the practicable system after carrying out transform operation with the above information. In this thesis, it will be approached how to design and materialize the Bachelor management system based on MDA and the importance of modeling should be emphasized by applying to the approach method based on MDA. It should be suggested how to develop software efficiently, written it out in PIM, and suggested the process transforming PSM into EJB by J2EE Platform. The system is designed and implemented using automatic tool, edit machine(Together Architect 2006 for Eclipse, Edit plus2) supporting MDA and Database Modeling tool(ER/WIN 4.1). In conclusion, it should be suggested the efficiency analysis result for development process of traditional and based on MDA.
Constructing A Loop Tree in CTOC
Kim, Ki-Tae ; Kim, Je-Min ; Yoo, Weong-Hee ;
The KIPS Transactions:PartD, volume 15D, issue 2, 2008, Pages 197~206
DOI : 10.3745/KIPSTD.2008.15-D.2.197
The CTOC framework was implemented to efficiently perform analysis and optimization of the Java bytecode that is often being used lately. In order to analyze and optimize the bytecode from the CTOC, the eCFG was first generated. Due to the bytecode characteristics of difficult analysis, the existing bytecode was expanded to be suitable for control flow analysis, and the control flow graph was drawn. We called eCFG(extended Control Flow Graph). Furthermore, the eCFG was converted into the SSA Form for a static analysis. Many loops were found in the conversion program. The previous CTOC performed conversion directly into the SSA Form without processing the loops. However, processing the loops prior to the SSA Form conversion allows more efficient generation of the SSA Form. This paper examines the process of finding the loops prior to converting the eCFG into the SSA Form in order to efficiently process the loops, and exhibits the procedures for generating the loop tree.
A Gompertz Model for Software Cost Estimation
Lee, Sang-Un ;
The KIPS Transactions:PartD, volume 15D, issue 2, 2008, Pages 207~212
DOI : 10.3745/KIPSTD.2008.15-D.2.207
This paper evaluates software cost estimation models, and presents the most suitable model. First, we transformed a relevant model into variables to make in linear. Second, we evaluated model's performance considering how much suitable the cost data of the actual development software was. In the stage of model performance evaluation criteria, we used MMRE which is the relative error concept rather than the absolute error. Existing software cost estimation model follows Weibull, Gamma, and Rayleigh function. In this paper, Gompertz function model is suggested which is a kind of growth curve. Additionally, we verify the compatability of other different growth curves. As a result of evaluation of model's performance, Gompertz function was considered to be the most suitable for the cost estimation model.
Implementation of Music Embedded System Software Using Real Time Software Analysis and Design Method
Choi, Seong-Min ; Oh, Hoon ;
The KIPS Transactions:PartD, volume 15D, issue 2, 2008, Pages 213~222
DOI : 10.3745/KIPSTD.2008.15-D.2.213
The existing approaches for the music application have not considered a real-time multi-tasking model. So, it suffers from a high complexity and a low flexibility in design as well as lack of predictability for the timely execution of critical tasks. In this paper, we design a new concurrent tasking architecture for a real-time embedded music system and examine if all real-time tasks can finish execution within their respective time constraints. The design is implemented on the Linux based Xhyper272 Board that uses the Intel Bulverde microprocessor.
Design and Implementation of Quality Broker Architecture to Web Service Selection based on Autonomic Feedback
Seo, Young-Jun ; Song, Young-Jae ;
The KIPS Transactions:PartD, volume 15D, issue 2, 2008, Pages 223~234
DOI : 10.3745/KIPSTD.2008.15-D.2.223
Recently the web service area provides the efficient integrated environment of the internal and external of corporation and enterprise that wants the introduction of it is increasing. Also the web service develops and the new business model appears, the domestic enterprise environment and e-business environment are changing caused by web service. The web service which provides the similar function increases, most the method which searches the suitable service in demand of the user is more considered seriously. When it needs to choose one among the similar web services, service consumer generally needs quality information of web service. The problem, however, is that the advertised QoS information of a web service is not always trustworthy. A service provider may publish inaccurate QoS information to attract more customers, or the published QoS information may be out of date. Allowing current customers to rate the QoS they receive from a web service, and making these ratings public, can provide new customers with valuable information on how to rank services. This paper suggests the agent-based quality broker architecture which helps to find a service providing the optimum quality that the consumer needs in a position of service consumer. It is able to solve problem which modify quality requirements of the consumer from providing the architecture it selects a web service to consumer dynamically. Namely, the consumer is able to search the service which provides the optimal quality criteria through UDDI browser which is connected in quality broker server. To quality criteria value decision of each service the user intervention is excluded the maximum. In the existing selection architecture, the objective evaluation was difficult in subjective class of service selecting of the consumer. But the proposal architecture is able to secure an objectivity with the quality criteria value decision where the agent monitors binding information in consumer location. Namely, it solves QoS information of service which provider does not provide with QoS information sharing which is caused by with feedback of consumer side agents.
Practical Quality Model for Measuring Service Performance in SOA
Oh, Sang-Hun ; Choi, Si-Won ; Kim, Soo-Dong ;
The KIPS Transactions:PartD, volume 15D, issue 2, 2008, Pages 235~246
DOI : 10.3745/KIPSTD.2008.15-D.2.235
Service-Oriented Architecture (SOA) is emerging as an effective approach for developing applications by dynamically discovering and composing reusable services. Generally, the benefits of SOA are known as low-development cost, high agility, high scalability, business level reuse, etc. However, a representative problem for widely applying SOA is the performance problem. This is caused by the nature of SOA such as service deployment and execution in distributed environment, heterogeneity of service platforms, use of a standard message format, etc. Therefore, performance problem has to be overcome to effectively apply SOA, and service performance has to be measured precisely to analyze where and why the problem has occurred. Prerequisite for this is a definition of a quality model to effectively measure service performance. However, current works on service performance lacks in defining a practical and precise quality model for measuring performance which adequately addresses the execution environment and features of SOA. Hence, in this paper, we define a quality model which includes a set of practical metrics for measuring service performance and an effective technique to measure the value of the proposed metrics. In addition, we apply the metrics for Hotel Reservation Service System (HRSS) to show the practicability and usefulness of the proposed metrics.
A Markup Language for Describing the Linkage between Sensor Data and Service in the Ubiquitous Environment
Lee, Hun-Soon ; Jin, Seung-Il ;
The KIPS Transactions:PartD, volume 15D, issue 2, 2008, Pages 247~256
DOI : 10.3745/KIPSTD.2008.15-D.2.247
In the ubiquitous environment, it is scattered all over our neighboring in many smart objects. These smart objects constantly produce the information and the amount of the generated information is massive. As the internet search engine came out to help us to find the useful data from the sea of the information connected to the internet, the sensor data stream processing middleware is appearing to make us to develop the ubiquitous service easily by extracting the meaningful information from the massive sensor data and delivering the extracted information to the application which makes our life convenient. We have to inform the information relating to the provided service to a middleware so that the ubiquitous service can be provided by using sensor data stream processing middleware. In this paper, we classify the information which is needed to express the ubiquitous service which uses sensor data for the service providing. And we propose a distinct markup language called Context-driven Service Markup Language (CSML) to effectively describe this information. We can easily express the various ubiquitous services which have to be provided in the various situations using proposed CSML.
The Implementation of Personal Audio Recorder Service based on Embedded Linux
Kim, Do-Hyung ; Lee, Kyung-Hee ; Lee, Cheol-Hoon ;
The KIPS Transactions:PartD, volume 15D, issue 2, 2008, Pages 257~262
DOI : 10.3745/KIPSTD.2008.15-D.2.257
This paper describes the implementations of the application service based on embedded Linux; Personal Audio Recorder (PAR) which uses WiBro network for data communications and CDMA network for voice communications. At PAR, when PAR client starts voice recording on a dual-mode terminal, the CDMA voice data of caller and callee is transmitted to storage server located in the Internet through WiBro network. Then, PAR server stores voice data on storage server according to the call number and call time. In case of shortage of storage space on terminal, PAR makes user to store voice data. And, PAR can search a catalog of stored data on server and play the specific content.
Implementing a Power Facility Management Services using RFID/USN Technology
Kim, Young-Il ; Shin, Jin-Ho ; Song, Jae-Ju ; Yi, Bong-Jae ;
The KIPS Transactions:PartD, volume 15D, issue 2, 2008, Pages 263~270
DOI : 10.3745/KIPSTD.2008.15-D.2.263
Research of ubiquitous computing becomes more popular topic along with the rapid development of wireless technologies. Firstly, research and development on RFID focuses on manufacturing and retail sectors, because it can improve supply chain efficiency. But, it changes to USN (Ubiquitous Sensor Network) by adding a sensor and wireless network technologies on it. In this research, we design and implement the electric facility management service framework to collect real time information of electric facility using RFID/USN. In electric power industry, it is important the supply of energy must be guaranteed. So many power utilities control and supervise the transmission line to avoid power failures. Utilities install many types of sensor to monitor important facilities by wired network such as optical cable and PLC. In this research, we develop the sensor node which is small, easy to install and using wired network. We design the service framework for electric facility management to collect data using RFID tag, reader and wireless sensor nodes and implement the electric facility management service.
An Automated Approach to Determining System's Problem based on Self-healing
Park, Jeong-Min ; Jung, Jin-Soo ; Lee, Eun-Seok ;
The KIPS Transactions:PartD, volume 15D, issue 2, 2008, Pages 271~284
DOI : 10.3745/KIPSTD.2008.15-D.2.271
Self-healing is an approach to evaluating constraints defined in target system and to applying an appropriate strategy when violating he constrains. Today, the computing environment is very complex, so researches that endow a system with the self-healing's ability that recognizes problem arising in a target system are being an important issues. However, most of the existing researches are that self-healing developers need much effort and time to analyze and model constraints. Thus, this paper proposes an automated approach to determine problem arising in external and internal system environment. The approach proposes: 1) Specifying the target system through the models created in design phase of target system. 2) Automatically creating constraints for external and internal system environment, by using the specified contents. 3) Deriving a dependency model of a component based on the created internal state rule. 4) Translating the constraints and dependency model into code evaluating behaviors of the target system, and determinating problem level. 5) Monitoring an internal and external status of system based on the level of problem determination, and applying self-healing strategy when detecting abnormal state caused in the target system. Through these, we can reduce the efforts of self-healing developers to analyze target system, and heal rapidly not only abnormal behavior of target system regarding external and internal problem, but also failure such as system break down into normal state. To evaluate the proposed approach, through video conference system, we verify an effectiveness of our approach by comparing proposed approach's self-healing activities with those of the existing approach.
Analyzing a Differentiation of IT Governance Decision Structure: Application of IT Strategic Grid Framework
Lee, Bong-Gyou ; Choi, Dong-Jin ; Lee, Young-Hee ; Oh, Ik-Jin ;
The KIPS Transactions:PartD, volume 15D, issue 2, 2008, Pages 285~296
DOI : 10.3745/KIPSTD.2008.15-D.2.285
The purpose of this paper is to examine the IT governance decision structure of the four strategic modes of IT strategy grid, and compare and analyze the differences in the IT governance decision structure of companies that produce superior results and those that produce inferior results. The survey method was used for this paper, and data from a total of 209 companies that were listed on the KOSDAQ 300 and KOSPI 200 were used for the analysis. The results show that each mode has a different IT governance decision structure from the others, and the IT governance decision structure of companies with high results and those with low results are also different for each mode. The results of this paper are significant in that, for each mode, it presents the decision structure framework for promoting desirable behavior of companies carrying out IT governance.