Facilitating dynamic web service composition with fine-granularity context management

Context is an important factor for the success of dynamic service composition. Although many contextbased AI or workflow approaches have been proposed to support dynamic service composition, there is still an unaddressed issue of the support of fine-granularity context management. In this paper, we propose a granularity-based context model together with an approach to supporting the intelligent context-aware service composing problem. The corresponding case study is provided to show the validity of our approach.<br /

A Context Model for Service Composition Based on Dynamic Description Logic

Abstract: A service composition task for service broker is to discovery and compose provider&apos;s services to satisfy user&apos;s request. Many researchers model the context utilizing ontology-based or attribute-based method to assist service composition. We propose a new context model by combining the context logic with the dynamic description logic (DDL), where user&apos; context, provider&apos;s context and broker&apos;s context are described by DDL separately and reasoned under the context logic. The reasoning results finally can be used to discovery and compose services intelligently. We evaluate this model on a simple, yet realistic example, and the results show that our context model provides a practical solution

A Novel Graph Constructor for Semisupervised Discriminant Analysis: Combined Low-Rank and k

Semisupervised Discriminant Analysis (SDA) is a semisupervised dimensionality reduction algorithm, which can easily resolve the out-of-sample problem. Relative works usually focus on the geometric relationships of data points, which are not obvious, to enhance the performance of SDA. Different from these relative works, the regularized graph construction is researched here, which is important in the graph-based semisupervised learning methods. In this paper, we propose a novel graph for Semisupervised Discriminant Analysis, which is called combined low-rank and k-nearest neighbor (LRKNN) graph. In our LRKNN graph, we map the data to the LR feature space and then the kNN is adopted to satisfy the algorithmic requirements of SDA. Since the low-rank representation can capture the global structure and the k-nearest neighbor algorithm can maximally preserve the local geometrical structure of the data, the LRKNN graph can significantly improve the performance of SDA. Extensive experiments on several real-world databases show that the proposed LRKNN graph is an efficient graph constructor, which can largely outperform other commonly used baselines

Toward Learning Model-Agnostic Explanations for Deep Learning-Based Signal Modulation Classifiers

Recent advances in deep learning (DL) have brought tremendous gains in signal modulation classification. However, DL-based classifiers lack transparency and interpretability, which raises concern about model's reliability and hinders the wide deployment in real-word applications. While explainable methods have recently emerged, little has been done to explain the DL-based signal modulation classifiers. In this work, we propose a novel model-agnostic explainer, Model-Agnostic Signal modulation classification Explainer (MASE), which provides explanations for the predictions of black-box modulation classifiers. With the subsequence-based signal interpretable representation and in-distribution local signal sampling, MASE learns a local linear surrogate model to derive a class activation vector, which assigns importance values to the timesteps of signal instance. Besides, the constellation-based explanation visualization is adopted to spotlight the important signal features relevant to model prediction. We furthermore propose the first generic quantitative explanation evaluation framework for signal modulation classification to automatically measure the faithfulness, sensitivity, robustness, and efficiency of explanations. Extensive experiments are conducted on two real-world datasets with four black-box signal modulation classifiers. The quantitative results indicate MASE outperforms two state-of-the-art methods with 44.7% improvement in faithfulness, 30.6% improvement in robustness, and 44.1% decrease in sensitivity. Through qualitative visualizations, we further demonstrate the explanations of MASE are more human interpretable and provide better understanding into the reliability of black-box model decisions