No abstract

No abstract

With the advance of cloud computing, cloud service providers (CSP) provide increasingly diversified services to users. To utilize general search engine, such as Google, is not an effective and efficient if the services are similar but with different attributes. Therefore, an intelligent service discovery platform is necessary for seeking suitable services accurately and quickly. In the paper 1 , we propose a framework that integrates intelligent agent and ontology for service discovery in cloud environment. The framework contains some agents and mainly assists users to discovering suitable service according to user demand. User can submit his flat-text based request for discovering required service. We implement a cloud service discovery environment to demonstrate the concept and its application. We also utilize the Recall and Precision to evaluate the accuracy of the system.

No abstract

The arrangement graph A nYk is not only a generalization of star graph (n À k 1), but also more¯exible. In this investigation, we elucidate the problem of embedding of multiple spanning trees in an arrangement graph with the objective of congestion-free. This result is to report how to exploit 2n À k edge disjoint spanning trees in an arrangement graph, where each congestion-free spanning tree's height is 2k À 1. Our scheme is based on a subgraphpartitioning scheme. First, we construct 2n À k base spanning trees in every A nÀk2Y2 . Then, we recursively construct 2n À k spanning trees from every A nÀk2Y2 up to A nYk by a bottom-up approach. This is a near-optimal result since all of possible edges in the base subarrangement A nÀk2Y2 are fully utilized. Ó