Woosung Jung

Automatic Discovery of Web Services Based on Dynamic Black-Box Testing

Most current approaches to Web Service discovery exploit description logic-based matchmaking algorithms. Until now, these Semantic Web Service technologies have not substituted for traditional search methods, because higher modeling costs, such as representing Service Annotation Ontologies and Domain Ontologies, are required. In this paper, we present an automatic testing-based approach to the discovery of Web Services. Through the automatic generation and execution of test cases based on a small amount of semantic information, Web Services are simultaneously evaluated and a decision is made on which Web Services the requestor needs. The experimental results show our technique reduces modeling costs significantly, whilst outperforming existing approaches in terms of precision. Furthermore, reliable QoS attribute values are obtained as by-products.

A framework to support qos-aware usage of web services

Web services offer an easier, effective, efficient way to support a service paradigm. However, there is lack of adequate QoS support in using web services. In this paper, we propose a framework to support QoS aspects of web services. Three new elements are added to the original web service framework: QoS Server, QoS UDDI Broker and QoS Agent. In this framework, a requester is able to query more flexibly by using history QoS data of each web service with few load.

A Complexity Metric for Web Applications Based on the Entropy Theory

Web applications are becoming more and more important with the rapid increase in the web environment. The maintenance of web applications is also one of the main problems in that area. Traditional maintenance approach can no longer be applied to web applications, because of the specific characteristics of web applications. In this paper, a complexity measure for web application, WCOX, is proposed. It is related to the maintenance efforts. WCOX is defined using the entropy theory and a web model extracted by static analysis. The entropy of software is regarded as an average information quantity of the software and it means the aging and degradation of the software. Most of the existing web complexity measures are simply based on count, which means that they only show limited viewpoints of a system. Since WCOX is concerned with an information quantity and understandability, it not only represents the structural complexity, but can also be used as a practical maintenance indicator. Experimental results demonstrate the applicability and effectiveness of the proposed measure.

Agile development of Web application by supporting process execution and extended UML model

Agile and systematic development is important in Web application methodology because clients expect their frequent requirement changes to be implemented rapidly and regularly. However, previous studies may not be suitable for such development. In this paper we propose a methodology for agile and somewhat systematic development of Web application. The methodology includes models, tools, and an agile process. The models extended from UML focus on the behavior of Web application. The agile process aims to have quick-to-market property and adaptability to requirement changes. Tools including process manager and Web modeler support process execution and modeling activity to guide developers in applying the process. An example of university assets management system and a comparison between our methodology and other processes are given to validate our methodology.

A type-based analysis for verifying web application

Web applications have become standard for several areas, however, they tend to be poorly structured and do not have strongly-typed support. In this paper, we present a web application model and a process to extract the model using static and dynamic analysis. We show recurring problems regarding type and structure in web applications and formally describe algorithms to verify those problems. Finally, we show the potentials of our approach via tool support.

WSIM: Detecting Clone Pages Based on 3-Levels of Similarity Clues

Code clones often result in code inconsistencies, which eventually increase cost and degrade quality. Web applications have higher rate of clones than normal software and it is more and more necessary to detect clones in web applications. In this paper, three levels of views in detecting clone pairs are suggested for a web application. The proposed technique utilizes relationships between web pages, passed parameters, and target entities as similarity clues. The results of the experiments also represent the trade-off between recall rate and accuracy. And then, two approaches, static and dynamic selection, are suggested for deciding candidates of clone pairs. As a result, the combined strategy of three levels of methods and two approaches of candidate selection is recommended. Finally, applicability of the proposed approach is shown from the experiments.

An Adaptive Software Framework based on Service Composition

Adaptive software needs to select most appropriate solution among multiple ways to accomplish a goal as its environment changes dynamically. This uncertainty of environment and solution makes hard to design adaptive software. Further, diversity of adaptation granularity makes architecture of adaptive software more complicated. Coordination problem between adaptive software is also an important issue. In this paper, we present a service based adaptive software framework which resolves these issues.

Web Page Similarity based on Size and Frequency of Tokens

Abstract 논문투고일：2012년 07월 27일 논문수정완료일：2012년 09월 14일 논문게재확정일：2012년 10월 03일* 이 논문은 2012학년도 충북대학교 학술연구지원사업의 연구비 지원, 그리고 2012학년도 경북대학교 학술연구비에 의하여 연구되었음.** 경북대학교 IT대학 컴퓨터학부*** 충북대학교 전자정보대학 컴퓨터공학과, 교신저자It is becoming hard to maintain web applications because of hig h complexity and duplication of web pages. However, most of research about code clone is focusing on code hunks, an d their target is limited to a specific language. Thus, we propose GSIM, a language-independent statistical approach to detect similar pages based on scarcity and frequency of customized tokens. The tokens, which can be obtained from pa ges splitted by a set of given separators, are defined as atomic elements for calculating similarity between two pages . In this paper, the domain definition for web applications and algorithms for collecting tokens, making matrics, calculating similarity are given. We also conducted experiments on open source codes for evaluation, with our GSIM tool. The results show the applicability of the proposed method and the effects of parameters such as threshold, toughne ss, length of tokens, on their quality and performance.

A UI-Driven lightweight framework for developing web applications

Due to the increasing complexity of Web applications, systematic processes and supporting tools are required for the development of Web applications. In this paper, we propose a UI-driven lightweight framework for building Web applications. This framework is based on an incremental and iterative process that covers the whole development phases. Each identified stakeholder carries out their activities in a collaborative and parallel manner. In the proposed framework, a UI prototype and a conceptual model are produced in the early phase of the development.