In recent years, there has been an increasing interest in web service composition due to its importance in practical applications. At the same time, cloud computing is gradually evolving as a widely used computing platform where many different web services are published and available in cloud data centers. The issue is that traditional service composition methods mainly focus on how to find service composition sequence in a single cloud, but not from a multi-cloud service base. It is challenging to efficiently find a composition solution in a multiple cloud base because it involves not only service composition but also combinatorial optimization. In this paper, we first propose a framework of service composition in multi-cloud base environments. Next, three different cloud combination methods are presented to select a cloud combination subject to not only finding feasible composition sequence, but also containing minimum clouds. Experimental results show that a proposed method based on artificial intelligence (AI) planning and combinatorial optimization can more effectively and efficiently find sub-optimal cloud combinations.

No abstract

No abstract

Planning as satisfiability is a principal approach to planning with many eminent advantages. The existing planning as satisfiability techniques usually use encodings compiled from STRIPS. We introduce a novel SAT encoding scheme (SASE) based on the SAS+ formalism. The new scheme exploits the structural information in SAS+, resulting in an encoding that is both more compact and efficient for planning. We prove the correctness of the new encoding by establishing an isomorphism between the solution plans of SASE and that of STRIPS based encodings. We further analyze the transition variables newly introduced in SASE to explain why it accommodates modern SAT solving algorithms and improves performance. We give empirical statistical results to support our analysis. We also develop a number of techniques to further reduce the encoding size of SASE, and conduct experimental studies to show the strength of each individual technique. Finally, we report extensive experimental results to demonstrate significant improvements of SASE over the state-of-the-art STRIPS based encoding schemes in terms of both time and memory efficiency

Since the discovery of chemically peculiar stars in globular clusters in the last century, the study of multiple populations has become increasingly important, given that chemical inhomogeneity is found in almost all globular clusters. Despite various proposed theories attempting to explain this phenomenon, fitting all the observational evidence in globular clusters with one single theory remains notoriously difficult and currently unsuccessful. In order to improve existing models and motivate new ones, we are observing globular clusters at critical conditions, e.g., metal-rich end, metal-poor end, and low mass end. In this paper, we present our first attempt to investigate multiple populations in low mass globular clusters. We obtained low-resolution spectra around 4000 Å of 30 members of the globular cluster Palomar 13 using OSIRIS/Multi-object spectrograph mounted at the Gran Telescopio Canarias. The membership of red giant branch stars is confirmed by the latest proper motions from Gaia DR2 and literature velocities. After comparing the measured CN and CH spectral indices with those of the stellar models, we found a clear sign of nitrogen variation among the red giant branch stars. Palomar 13 may be the lowest mass globular cluster showing multiple populations.

No abstract

Planning as satisfiability is a principal approach to planning with many eminent advantages. The existing planning as satisfiability techniques usually use encodings compiled from the STRIPS formalism. We introduce a novel SAT encoding scheme based on the SAS+ formalism. It exploits the structural information in the SAS+ formalism, resulting in more compact SAT instances and reducing the number of clauses by up to 50 fold. Our results show that this encoding scheme improves upon the STRIPS-based encoding, in terms of both time and memory efficiency.

No abstract