• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.217-220
• /
• 2004

According as utilization for web increases rapidly, it is demanded that model about support interaction between web-based applications systematically and solutions can integrate new distributed platforms and existing environment effectively, accordingly, Web Services appeared by solution in reply. These days, a lot of software and hardware companies try to adoption of Web Services to their market, attenpt to construct their applications associationing components from various Web Services providers. However, to execute Web Services completely. it must have interoperability and need the standardization work that avoid thing which is subject to platform, application as well as service and programming language from other companies. WS-I (Web Services Interoperability organization) have established Basic Profile 1.0 based on XML, UDDI, WSDL and SOAP for web services interoperability and developed usage scenario Profile to apply Web Services in practice. In this paper, to verify suitability Web Services interoperability between heterogeneous two applications, have design and implements the Book Information Web Services that based on the Web Services Client of J2SE platform and the Web Services Server of .NET platform, so that analysis and verify the service by adaptation of WS-I Basic Profile.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.3
• /
• pp.179-192
• /
• 2007

Based on ontologies, semantic Web services enable the discovery, selection, and composition. OWL-S is a do facto standard ontology for describing semantics of Web services. Due to the difficulty of the OWL-S grammar, the teaming curve for constructing OWL-S description manually can be steep. This paper presents an efficient method for generating OWL-S descriptions from UML diagrams, which are widely used for software design and development. The proposed method is based on UML profiles to generate an OWL-S ontology from sequence or activity diagrams, which represent the behavior of a business process. Specifically, an XMI file extracted from UML diagrams is transformed into an OWL-S description via an XSLT script. Experimental results with a large volume of UML diagrams show that the proposed method deals with the control flow of complex processes and is superior to previous methods.

• Journal of Digital Contents Society
• /
• v.8 no.3
• /
• pp.269-277
• /
• 2007

Web service is an important technology to develop business to business e-commerce application. From a business perspective of time to market, dynamic evolution offers flexibility that software can adapt to unforeseen and fluctuating business requirements. OWL-S, based on OWL, is a service ontology language. The semantics provided by OWL support automation of service discovery, invocation, and service composition. In this paper we propose a framework to support dynamic evolution of service-oriented applications. We extend use-case analysis method to derive service description by defining requirements concept and mapping from requirement concept to activity diagram. A prototype is provided to show the validity of this framework.

• Journal of Internet Computing and Services
• /
• v.13 no.3
• /
• pp.115-126
• /
• 2012

Mashups have become very popular over the last few years, and their use also varies for IT convergency services. In spite of their popularity, there are several challenging issues when combining Open APIs into mashups, First, since portal sites may have a large number of APIs available for mashups, manually searching and finding compatible APIs can be a tedious and time-consuming task. Second, none of the existing portal sites provides a way to leverage semantic techniques that have been developed to assist users in locating and integrating APIs like those seen in traditional SOAP-based web services. Third, although suitable APIs have been discovered, the integration of these APIs is required for in-depth programming knowledge. To solve these issues, we first show that existing techniques and algorithms used for finding and matching SOAP-based web services can be reused, with only minor changes. Next, we show how the characteristics of APIs can be syntactically defined and semantically described, and how to use the syntactic and semantic descriptions to aid the easy discovery and composition of Open APIs. Finally, we propose a goal-directed interactive approach for the dynamic composition of APIs, where the final mashup is gradually generated by a forward chaining of APIs. At each step, a new API is added to the composition.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.465-468
• /
• 2005

본 논문에서는 OWL-S 서비스 온톨로지를 자동으로 생성하는 방법에 대한 연구결과를 제공한다. 자동생성을 위하여 UML 클래스 다이어그램 및 상태차트 다이어그램을 XMI 파일들로 변환한 후 원자 서비스 및 속성들에 대한 정보와 복합 서비스 조합에 대한 정보를 각각 추출한다. 추출된 정보는 UML 상태차트 다이어그램 구성 요소들과 OWL-S 복합 서비스를 위한 구조물들 사이의 매핑 규칙들을 통하여 XSLT 응용에서 OWL-S 서비스 모델 온톨로지를 자동으로 생성시키는데 사용된다. 생성된 온톨로지의 타당성 검증을 위해서 이용 가능한 여럿의 유효성 검사를 수행하였다. 우리의 방법론은 자동적, 효과적 및 일반적일 뿐만 아니라 서비스 온톨로지 생성자인 개발자들에게 매우 친숙한 환경에서 수행된다는 장점들을 가진다.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.5
• /
• pp.435-444
• /
• 2012

Although the multi-scale map database should be constructed for the web map services and location-based services, much part of generation process is based on the manual editing. In this study, the map generalization methodology for automatic construction of multi-scale database from the primary data is proposed. Moreover, the generalization methodology is applied to the real map data and the prototype of multi-scale map dataset is generated. Among the generalization operators, selection/elimination, simplification and amalgamation/aggregation is applied in organized manner. The algorithm and parameters for generalization is determined experimentally considering T$\ddot{o}$pfer's radical law, minimum drawable object of map and visual aspect. The target scale level is five(1:1,000, 1:5,000, 1:25,000, 1:100,000, 1:500,000) and for the target data, new address data and digital topographic map is used.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.10
• /
• pp.2292-2298
• /
• 2010

A mashup is a web page or application that uses and combines information, contents or Open APIs available on the web to create a new service. The mashup developed by the need not combination of simple information can contribute to new added-values with practicality and convenience. Thus, in this paper, we want to develop a RIA-based dynamic mashup service for the users considering weather forecast and marine information importantly. We design and implement the system that it can register a number of information about a domain dynamically through registration process based on the map and present a mark of domain location on the map and the information including internal environment, external environment and weather of related to the domain within a webpage. Implemented service need not require a tedious process visiting other web sites every time to confirm the relevant information because we can see simultaneously related information with a map within a page.

• Proceedings of the ESK Conference
• /
• 1997.04a
• /
• pp.138-144
• /
• 1997

본 연구에서는 VRML(Virtual Reality Modeling Language)을 이용하여 월드 와이드 웹(World Wide Web; WWW) 상에서의 3차원 디렉토리 서비스인 "3D 한마당"을 구현하였다. 현재 WWW 상에서는 많은 2차원 디렉 토리 서비스가 존재하나 3차원검색 서비스에 비해 사용자를 위한 가상 현실감이 부족한 단점이 있다. 또한 3차원 검색 서비스는 그 잠재적 수요가 점차 증가함에도 불구하고 아직 적은 편이며, 또한 중오성이 차츰 커 지는 전자 상거래를 위해 특화된 디렉토리 서비스도 그 요구에 비해 많지 않다. 3차원으로 디렉토리 서비스의 기능을 수행할 수 있는 3D 한마당은 HTML(Hyper Text Markup Language)에 의해 기술되는 2차원 전자 거래용 디 렉토리 서비스인 "한마당"을 보조하기 위해 제작된 것으로, VRML 1.0 사양에 맞추어서 만들어졌다. 3D 한마당 을 위한 VRML 월드를 만들기 위해, Pentium PC에서 3-D MAX 소프트웨어로 각 구성 객체들을 저작한 후, 이를 조합하여 VRML 1.0 사양을 따라 월드로 변환하는 방법을 사용하였다. 이렇게 완성된 3D 한마당은 기존의 2차원 전자 거래용 디렉토리 서비스인 한마당에서 하이퍼링크로 바로 접근할 수 있으며, 또한 월드 안의 객체에서 그 객체에 대한 2차원 테이블로도 연결이 가능하게 하였다. 이러한 3차원 가상상점 디렉토리 서비스는 전자 거래에 특화된 특성 때문에 정해진 개수의 객체들만 요구되어 구현이 쉬운 이점이 있고, 보다 인간에게 자연스러운 인테 페이스로 정보 검색을 지원하게 해줄 수 있다.정보 검색을 지원하게 해줄 수 있다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.6
• /
• pp.503-513
• /
• 2005

With the recognition of the importance of computational approach for protein-protein interaction prediction, many techniques have been developed to computationally predict protein-protein interactions. However, few techniques are actually implemented and announced in service form for general users to readily access and use the techniques. In this paper, we design and implement a protein interaction prediction service system based on the domain combination based protein-protein interaction prediction technique, which is known to show superior accuracy to other conventional computational protein-protein interaction prediction methods. In the prediction accuracy test of the method, high sensitivity($77\%$) and specificity($95\%$) are achieved for test protein pairs containing common domains with teaming sets of proteins in a Yeast. The stability of the method is also manifested through the testing over DIP CORE, HMS-PCI, and TAP data. Performance, openness and flexibility are the major design goals and they are achieved by adopting parallel execution techniques, web Services standards, and layered architecture respectively. In this paper, several representative user interfaces of the system are also introduced with comprehensive usage guides.

• Journal of Internet Computing and Services
• /
• v.5 no.1
• /
• pp.15-23
• /
• 2004

This paper presents distributive web-caching technique on the Head-End-Network (HNET) to solve excessive load of multimedia sever and inefficient use of network resources, The proposed web-caching is not concentration of load for a specific Head-End-Node(HEN), and it has advantage that there is no copy of a specific item on distributive HENs. This technique distributively stores on HENs partial streams of requested videos from clients connected to HENs and the order of store streams follows the order of request of identical video items from HENs. Thus, storing streams on each HEN that requests sevice are different. When a client requests the cached video on some HENs, the HEN that connects him receives streams in the order of store from HENs which stored them and it transmits them to him. These procedures are performed under the control of SA. This technique uses cache replacement algorithm that the combination of LFU, LRU and the last remove for the first stream of videos In order to reduce end-to-end delay.