• Journal of Climate Change Research
• /
• v.9 no.3
• /
• pp.235-243
• /
• 2018

Loss of favorable habitats for species due to temperature increase is one of the main concerns of climate change on the ecosystem, and endangered species might be much more sensitive to such unfavorable changes. This study aimed to analyze the impact of future climate change on endangered wild animals in South Korea by investigating thermal sensitivity and vulnerability to temperature increase. We determined thermal sensitivity by testing normality in species distribution according to temperature. Then, we defined the vulnerability when the future temperature range of South Korea completely deviate from the current temperature range of species distribution. We identified 13 species with higher thermal sensitivity. Based on IPCC future scenarios RCP 4.5 and RCP 8.5, the number of species vulnerable to future warming doubled from 3 under RCP4.5 to 7 under the RCP8.5 scenario. The species anticipated to be at risk under RCP 8.5 are flying squirrel (Pteromys volans aluco), ural owl (Pteromys volans aluco), black woodpecker (Dryocopus martius), tawny owl (Strix aluco), watercock (Gallicrex cinerea), schrenck?s bittern (Ixobrychus eurhythmus), and fairy pitta (Pitta nympha). The other 10 species showing very narrow temperature ranges even without normal distributions and out of the future temperature range may also need to be treated as vulnerable species, considering the inevitable observation scarcity of such endangered species.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.2
• /
• pp.27-44
• /
• 2008

Owl-based ontology is useful to realize the context-aware services which are composed of the distributed and self-configuring modules. Many ontology-based inference engines are developed to infer useful information from ontology. Since these engines show the uniqueness in terms of speed and information richness, it's difficult to ensure stable operation in providing dynamic context-aware services, especially when they should deal with the complex and big-size ontology. To provide a best inference service, the purpose of this paper is to propose a novel methodology of context-aware engine selection in a contextually prompt manner Case-based reasoning is applied to identify the causality between context and inference engined to be selected. Finally, a series of experiments is performed with a novel evaluation methodology to what extent the methodology works better than competitive methods on an actual context-aware service.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.11
• /
• pp.5856-5865
• /
• 2013

The demand for Mobile Web Services has increased to overcome the issue of Mobile Application's platform dependencies and device resource's limitations. The method to improve productivity of the development and operation of the Mobile Web Services is to provide a low-coupling between Mobile Webs. In this paper, we propose the Recommendation Technique of dynamic Mobile Web integration to reduce the coupling. The Mobile Web Recommendation Technique is proposed based on XPDL.

• Journal of KIISE:Software and Applications
• /
• v.36 no.3
• /
• pp.187-199
• /
• 2009

With the advent of Web 2.0, OpenAPIs are becoming an increasing trend to emphasize Web as platform recently. OpenAPIs are used to combine services and generate new services by mashup. However because the standard documents for OpenAPIs do not exist, it may restrict the use of OpenAPIs. Previous studies of OpenAPIs mashup have been limited to tool design or language definition for service combination rather than dynamic composition. On the other hand, Web services that are a software technology implementing SOA provide standard documents such as WSDL to explain each service, UDDI to register it, and SOAP to transfer messages. Thus Web applications can interpret and execute services by using these technologies. Recent works have also been performed to provide semantic features and dynamic composition for SOA. If a dynamic and systematic approach is provided to combine Web services and OpenAPIs, Web applications can provide users with diverse services. In this study, we present a SOA based framework for mashup of OpenAPIs and Web services. The framework supports dynamic composition of OpenAPIs and Web services, where the process of composite services is described in OWL-S. A prototype is provided to validate our framework. The framework is expected to add diversity to typical Web services.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.505-507
• /
• 2005

시맨틱 웹 서비스 검색시스템은 제공자가 기술한 웹 서비스 시맨틱 기술을 웹 서비스 사용자의 요청에 의해 검색하여 사용자에게 반환한다. 이러한 검색은 의미적 비교를 통해 이루어지며, 의미적 비교는 OWL-S[4]와 같은 표준을 통해 기술된 웹 서비스의 입력과 출력, 조건, 효과(Input, Output, Precondition, Effect) 즉, IOPE 와 사용자의 요청의 그것에 대해 수행된다. 하지만, 이러한 검색은 때때로 웹 서비스를 이용하여 이용자에게 서비스를 제공하는 지능형 에이전트에게 적합하지 않다. 지능형 에이전트는 웹 서비스의 실행을 위한 입력의 변환과 반환된 출력의 선택을 통해 서비스를 이용 가능하므로 IOPE의 형식에 대한 정확한 일치를 요구하지 않는다. 본 논문에서는 지능형 에이전트에 보다 융통성 있는 검색 서비스의 제공을 위한 제약조건을 기반으로 시맨틱 웹 서비스 검색시스템에 대하여 설명한다.

• Asia pacific journal of information systems
• /
• v.18 no.1
• /
• pp.79-96
• /
• 2008

One of the roles of the Semantic Web services is to execute dynamic intra-organizational services including the integration and interoperation of business processes. Since different organizations design their processes differently, the retrieval of similar semantic business processes is necessary in order to support inter-organizational collaborations. Most approaches for finding services that have certain features and support certain business processes have relied on some type of logical reasoning and exact matching. This paper presents our approach of using imprecise matching for expanding results from an exact matching engine to query the OWL(Web Ontology Language) MIT Process Handbook. MIT Process Handbook is an electronic repository of best-practice business processes. The Handbook is intended to help people: (1) redesigning organizational processes, (2) inventing new processes, and (3) sharing ideas about organizational practices. In order to use the MIT Process Handbook for process retrieval experiments, we had to export it into an OWL-based format. We model the Process Handbook meta-model in OWL and export the processes in the Handbook as instances of the meta-model. Next, we need to find a sizable number of queries and their corresponding correct answers in the Process Handbook. Many previous studies devised artificial dataset composed of randomly generated numbers without real meaning and used subjective ratings for correct answers and similarity values between processes. To generate a semantic-preserving test data set, we create 20 variants for each target process that are syntactically different but semantically equivalent using mutation operators. These variants represent the correct answers of the target process. We devise diverse similarity algorithms based on values of process attributes and structures of business processes. We use simple similarity algorithms for text retrieval such as TF-IDF and Levenshtein edit distance to devise our approaches, and utilize tree edit distance measure because semantic processes are appeared to have a graph structure. Also, we design similarity algorithms considering similarity of process structure such as part process, goal, and exception. Since we can identify relationships between semantic process and its subcomponents, this information can be utilized for calculating similarities between processes. Dice's coefficient and Jaccard similarity measures are utilized to calculate portion of overlaps between processes in diverse ways. We perform retrieval experiments to compare the performance of the devised similarity algorithms. We measure the retrieval performance in terms of precision, recall and F measure? the harmonic mean of precision and recall. The tree edit distance shows the poorest performance in terms of all measures. TF-IDF and the method incorporating TF-IDF measure and Levenshtein edit distance show better performances than other devised methods. These two measures are focused on similarity between name and descriptions of process. In addition, we calculate rank correlation coefficient, Kendall's tau b, between the number of process mutations and ranking of similarity values among the mutation sets. In this experiment, similarity measures based on process structure, such as Dice's, Jaccard, and derivatives of these measures, show greater coefficient than measures based on values of process attributes. However, the Lev-TFIDF-JaccardAll measure considering process structure and attributes' values together shows reasonably better performances in these two experiments. For retrieving semantic process, we can think that it's better to consider diverse aspects of process similarity such as process structure and values of process attributes. We generate semantic process data and its dataset for retrieval experiment from MIT Process Handbook repository. We suggest imprecise query algorithms that expand retrieval results from exact matching engine such as SPARQL, and compare the retrieval performances of the similarity algorithms. For the limitations and future work, we need to perform experiments with other dataset from other domain. And, since there are many similarity values from diverse measures, we may find better ways to identify relevant processes by applying these values simultaneously.

• Journal of Korea Multimedia Society
• /
• v.10 no.2
• /
• pp.147-169
• /
• 2007

Semantic Web Services Discovery matches between users' requirements and the ontological description of Web Services. However, concepts of an ontology can be interpreted differently according to a point of view. Previous works are limited in interpreting concepts. Since they lack a precise scheme of describing the advertisements and requirements of services and users, respectively, and even do not support a sophisticated matching, semantic mismatches may occur. This paper presents a sophisticated method of discovering Web services. The proposed method facilitates specifying semantics precisely and flexibly based on a proposed integrated concept model. Additionally, more sophisticated discovery is supported by computing complex matchings with many-to-many relationships. Experimental results show that the proposed method performs more efficiently for various kinds of user requests, compared with previous works.