Various remote sensing applications have widely used domain adaptation (DA) methods. Since it does not need to add human interpretation in the target domain, it can be used in cross-region, multi-temporal, and multi-sensor application scenarios. In order to further optimize the design of the loss function and better address the challenges of DA in remote sensing, in this paper, we propose a new universal DA method named C ³ DA for scene recognition of remote sensing images. It has a comprehensive C ³ criterion for recognizing the "unknown" classes by innovatively fusing confidence, consistency, and certainty of samples to make our network training more efficient. We evaluate the performance of our proposed method based on six transfer tasks on three remote sensing datasets. The evaluation results show that our proposed method achieves an average H-score of 58.44%, significantly higher than other SOTA universal DA methods with an average improvement of 2.32~29.43%. Compared to the baseline ResNet-50, it achieves up to 19.92% improvement, demonstrating that the proposed method outperforms in the universal DA scenario. In the future, we also plan to expand the application of this method to more scenarios.

The Mobile Edge Network (MEN) has emerged as the basic infrastructure to support fifth-generation networks, mobile edge computing and fog computing. The characteristics of mobility must be addressed to guarantee the quality of service in MENs. As one of the critical problems in MENs, flexible deployment plays a part in exploiting edge networks. Despite the abundance of recently proposed strategies, most concentrate on the change in user demands and inevitably ignore the influence for the user mobility, which is common in future networks. We propose Provision for Mobile Edge Computing (PMEC), a prototype that takes advantage of storage devices with flexible placement. In PMEC, we accommodate various considerations and select different storage devices to cache, deploying the cache with the relationship of a two-tiered structure in the MEN. Thus, we construct a flexible overlay network with the objective of minimizing the cost in a two-tiered edge network. Based on the analysis of the problem, we solve the two-tiered placement from bottom to top using the dynamic minimal spanning tree (MST) algorithm and design two algorithms for each tier including the basic algorithm and the improved algorithms. The simulation is conducted on realistic data to demonstrate the performance of our algorithms.

Heterogeneous Information Networks (HINs) contain multiple types of nodes and edges; therefore, they can preserve the semantic information and structure information. Cluster analysis using an HIN has obvious advantages over a transformation into a homogenous information network, which can promote the clustering results of different types of nodes. In our study, we applied a Nonnegative Matrix Tri-Factorization (NMTF) in a cluster analysis of multiple metapaths in HIN. Unlike the parameter estimation method of the probability distribution in previous studies, NMTF can obtain several dependent latent variables simultaneously, and each latent variable in NMTF is associated with the cluster of the corresponding node in the HIN. The method is suited to co-clustering leveraging multiple metapaths in HIN, because NMTF is employed for multiple nonnegative matrix factorizations simultaneously in our study. Experimental results on the real dataset show that the validity and correctness of our method, and the clustering result are better than that of the existing similar clustering algorithm.

With the increasing volume of scientific computation data and the advancement of computer performance, scientific computation is becoming more dependent on the powerful computing capabilities of cloud computing. On cloud platforms, tasks in scientific workflows are assigned to computational resources and executed according to specific strategies. Therefore, workflow scheduling has become a key factor affecting efficiency. This paper proposes a hybrid scientific workflow scheduling algorithm, HICA, to address the scheduling problem of scientific workflows in symmetric homogeneous cloud environments with optimization goals of makespan and cost. HICA combines the Imperialist Competitive Algorithm (ICA) with the HEFT algorithm, integrating HEFT into the initial population of the ICA to accelerate the convergence of the ICA. Experimental results show that the proposed hybrid approach outperforms other algorithms in real-world workflow applications. Specifically, when the workflow scale is 100, the average improvements in makespan and cost are 133.89 and 273.33, respectively; when the workflow scale is 1000, the improvements are 371.62 and 9178.98. The scheduling results for the Earth System Model parameter tuning workflow show that compared to the scenario without using a scheduling algorithm, the makespan and cost were improved by 13% and 21%, respectively.