Comprehensive semantic segmentation on renal pathological images is challenging due to the heterogeneous scales of the objects. For example, on a whole slide image (WSI), the cross-sectional areas of glomeruli can be 64 times larger than that of the peritubular capillaries, making it impractical to segment both objects on the same patch, at the same scale. To handle this scaling issue, prior studies have typically trained multiple segmentation networks in order to match the optimal pixel resolution of heterogeneous tissue types. This multi-network solution is resource-intensive and fails to model the spatial relationship between tissue types. In this article, we propose the Omni-Seg network, a scale-aware dynamic neural network that achieves multi-object (six tissue types) and multi-scale (5× to 40× scale) pathological image segmentation via a single neural network. The contribution of this article is three-fold: (1) a novel scale-aware controller is proposed to generalize the dynamic neural network from single-scale to multi-scale; (2) semi-supervised consistency regularization of pseudo-labels is introduced to model the inter-scale correlation of unannotated tissue types into a single end-to-end learning paradigm; and (3) superior scale-aware generalization is evidenced by directly applying a model trained on human kidney images to mouse kidney images, without retraining. By learning from 150,000 human pathological image patches from six tissue types at three different resolutions, our approach achieved superior segmentation performance according to human visual assessment and evaluation of image-omics (i.e., spatial transcriptomics).

Human activity recognition (HAR) using deep neural networks has become a hot topic in human–computer interaction. Machines can effectively identify human naturalistic activities by learning from a large collection of sensor data. Activity recognition is not only an interesting research problem but also has many real-world practical applications. Based on the success of residual networks in achieving a high level of aesthetic representation of automatic learning, we propose a novel asymmetric residual network, named ARN. ARN is implemented using two identical path frameworks consisting of (1) a short time window, which is used to capture spatial features, and (2) a long time window, which is used to capture fine temporal features. The long time window path can be made very lightweight by reducing its channel capacity, while still being able to learn useful temporal representations for activity recognition. In this paper, we mainly focus on proposing a new model to improve the accuracy of HAR. In order to demonstrate the effectiveness of the ARN model, we carried out extensive experiments on benchmark datasets (i.e., OPPORTUNITY, UniMiB-SHAR) and compared the results with some conventional and state-of-the-art learning-based methods. We discuss the influence of networks parameters on performance to provide insights about its optimization. Results from our experiments show that ARN is effective in recognizing human activities via wearable datasets.

Efficient identification of influential nodes is one of the essential aspects in the field of complex networks, which has excellent theoretical and practical significance in the real world. A valuable number of approaches have been developed and deployed in these areas where just a few have used centrality measures along with their concerning deficiencies and limitations in their studies. Therefore, to resolve these challenging issues, we propose a novel effective distance‐based centrality (EDBC) algorithm for the identification of influential nodes in concerning networks. EDBC algorithm comprises factors such as the power of K‐shell, degree nodes, effective distance, and numerous levels of neighbor’s influence or neighborhood potential. The performance of the proposed algorithm is evaluated on nine real‐world networks, where a susceptible infected recovered (SIR) epidemic model is employed to examine the spreading dynamics of each node. Simulation results demonstrate that the proposed algorithm outperforms the existing techniques such as eigenvector, betweenness, closeness centralities, hyperlink‐induced topic search, H‐index, K‐shell, page rank, profit leader, and gravity over a valuable margin.

Cloud computing and mobile edge computing techniques supply efficient ways to solve the contradiction between the increasing computing and storage demands of portable terminals and the limited capacity. In this paper, we conduct a three-tier hierarchical service system with multiple UEs, multiple MECs, and a single cloud center. It's worth noting that multiple UEs with personalized options generate a large number of different tasks in real time. To deal with this offloading problem, a response ratio offloading strategy (RROS) centered on user preference and real-time nature is designed to make MECs or CC serve as many UEs as possible. Therefore, a MEC-choosing preference list of each UE is created based on its past experiences at first. Then, each MEC iteratively sorts UEs with its ranking in the UEs' preference list. In order to avoid that the first task arriving at MEC occupies too many resources of MEC and cannot achieve global optimization, we also adopt loop iterative sequencing for multiple tasks arriving within a stipulated time. Lastly, by comparing the optimal response ratio on different MECs and CC, multiple MECs and the CC collaborative offload computing tasks of multiple UEs. Experimental results show that the algorithm significantly outperforms conventional techniques.

The increasing number of satellites for specific space tasks makes it difficult for traditional satellite task planning that relies on ground station planning and on-board execution to fully exploit the overall effectiveness of satellites. Meanwhile, the complex and changeable environment in space also poses challenges to the management of multi-satellite systems (MSS). To address the above issues, this paper formulates a mixed integer optimization problem to solve the autonomous task planning for MSS. First, we constructed a multi-agent-based on-board autonomous management and multi-satellite collaboration architecture. Based on this architecture, we propose a hybrid genetic algorithm with simulated annealing (H-GASA) to solve the multi-satellite cooperative autonomous task planning (MSCATP). With the H-GASA, a heuristic task scheduling scheme was developed to deal with possible task conflicts in MSCATP. Finally, a simulation scenario was established to validate our proposed H-GASA, which exhibits a superior performance in terms of computational power and success rate compared to existing algorithms.