ICWS2011论文集Ⅱ与Ⅵ.docVIP

编号 论文题目（英文） 论文题目（中文） 摘要（英文） 摘要（英文） 作者 作者单位 论文所属方向 ICWS2011601 A Formal Model of Service Computing and Its Applications on Service Discovery 一种服务计算的形式化模型及其在服务发现中的应用 With the rapid development of services and software, how to share, integrate and discover them properly in open and dynamic network environment is one of the most important challenges for software technology. With monad techniques, we present a novel formal semantic model for service oriented computing in a black-box observation way. The monad-based model can help us formally describe and further study on software components and services through monads’ properties such as abstraction, reflection and composability. This model relatively improves service reuse and discovery, and it significantly facilitates web service composition and enables integration of legacy applications. 随着服务和软件的快速发展，如何正确的在开放和动态的网络环境中共享，整合和发现他们是软件技术最重要的挑战之一Monad技术，我们暗箱观测提出了一种新的Monad技术的模型可以帮助我们根据Monad的特性，如抽象性、反射性、组合性等，形式化地描述和软件组件该模型相对提高了服务和，促进Web服务组合的集成。 Yingzhou Zhang , Wei Fu, Lei Chen Bihuan Xu 南京大学计算机科学与技术系 服务计算，服务组合 编号 论文题目（英文） 论文题目（中文） 摘要（英文） 摘要（英文） 作者 作者单位 论文所属方向 ICWS2011602 Ontology-Driven Query Expansion using Map/Reduce Framework to Facilitate Federated Queries 基于Map/Reduce架构的用于改进Federated Queries的 Ontology驱动的Query Expansion In view of the need for a highly distributed and federated architecture, a robust query expansion has great impact on the performance of information retrieval. We aim to determine ontology-driven query expansion terms using different weighting techniques. For this, we consider each individual ontology and user query keywords to determine the Basic Expansion Terms (BET) using a number of semantic measures including Betweenness Measure (BM) and Semantic Similarity Measure (SSM). We propose a Map/Reduce distributed algorithm for calculating all the shortest paths in ontology graph. Map/Reduce algorithm will improve considerably the efficiency of BET calculation for large ontologies. 根据高度分布体系结构的需要，一个u