Automatic real personality recognition (RPR) aims to evaluate human real personality traits from their expressive behaviours. However, most existing solutions generally act as external observers to infer observers' personality impressions based on target individuals' expressive behaviours, which significantly deviate from their real personalities and consistently lead to inferior recognition performance. Inspired by the association between real personality and human internal cognition underlying the generation of expressive behaviours, we propose a novel RPR approach that efficiently simulates personalised internal cognition from external short audio-visual behaviours expressed by target individual. The simulated personalised cognition, represented as a set of network weights that enforce the personalised network to reproduce the individual-specific facial reactions, is further encoded as a graph containing two-dimensional node and edge feature matrices, with a novel 2D Graph Neural Network (2D-GNN) proposed for inferring real personality traits from it. To simulate real personality-related cognition, an end-to-end (E2E) strategy is designed to jointly train our cognition simulation, 2D graph construction, and personality recognition modules. Experiments show our approach’s effectiveness in capturing real personality traits with superior computational efficiency.

Target detection is indispensable in both computer vision and remote sensing, where identifications of various objects and their spatial information are to be carried out in an image. However, remote sensing images often show complex backgrounds and inconspicuous features while having limited resolution in space; those would make detecting targets, especially those small ones, quite challenging. To solve these problems, namely RSMF-Net, a novel target detection framework for remote sensing images to improve target perception capability. The framework integrates a one-time feature aggregation mechanism through the RCS-OSA module and optimizes the feature extraction strategy, effectively solving the problem of small object feature representation. Furthermore, a multi-scale feature fusion approach is proposed based on the Gather-and-Distribute mechanism, called GDD, which further improves the feature fusion capability and enhances the performance of target detection. The Wise-IoU loss function is used for model training to further improve the accuracy and robustness of the detection.Experimental results on the RSOD public dataset demonstrate that RSMF-Net significantly outperforms existing methods in both detection accuracy and robustness.

The rapid growth of Internet of Vehicle (IoV) devices and Artificial Intelligence (AI) applications has accelerated the adoption of Cloud and Edge Computing. The advent of sixth-generation mobile communication technology (6G) further facilitates the deployment of Cloud-Edge collaborative computing in large-scale Intelligent Transportation Systems (ITS). Effective ITS must efficiently handle both latency-sensitive tasks (e.g., obstacle detection, traffic signal recognition) and computationally intensive tasks (e.g., path optimization, traffic flow prediction). However, existing Cloud-Edge collaborative frameworks struggle to accurately classify diverse workloads and provide efficient low-latency processing, leading to energy inefficiencies and task failures. To address these challenges, this paper introduces a Deep Learning-based Cloud-Edge Collaboration Framework (CECF) designed to optimize energy conservation in Cloud and Edge environments. CECF employs a DNN-based classifier to categorize workloads for processing in the Cloud or Edge. The classified tasks are managed by a dedicated Cloud scheduler (DSGA) and an Edge scheduler (EA-DFPSO), respectively. To enhance scheduling efficiency for highly variable Cloud tasks, DSGA incorporates a novel self-adaptive mutation algorithm and a random point fixed distance crossover method. Extensive evaluations using real-world workload traces demonstrate that CECF achieves up to a 8.5% improvement in system reliability and reduces energy consumption by 35.88% compared to baseline approaches.

SUMMARY The growing number of services processed and stored in the cloud has led to difficulties in managing and discovering the required services efficiently. Multilevel index model is an efficient method to manage and retrieve services in service repositories. When adding a new service to a multilevel index model, a key needs to be selected for the service, but existing key selection methods cannot adapt to the situation that hot services change over time. To address this problem, this article proposes an adaptive key selection method to improve the efficiency of service retrieval. However, the service addition operation of the adaptive key selection method is inefficient in the multilevel index model. For this reason, this article improves the multilevel index model by introducing local equivalence partition. This indexing model improves the service addition efficiency of the adaptive key selection method without affecting the service retrieval efficiency. It is experimentally demonstrated that the retrieval and addition efficiencies of the adaptive key selection method are close to the ideal state optimum under the multilevel index model with local equivalence partitioning.

Abstract With the development of edge computing and artificial intelligence (AI) technologies, edge devices are witnessed to generate data at unprecedented volume. The edge intelligence (EI) has led to the emergence of edge devices in various application domains. The EI can provide efficient services to delay‐sensitive applications, where the edge devices are deployed as edge nodes to host the majority of execution, which can effectively manage services and improve service discovery efficiency. The multilevel index model is a well‐known model used for indexing service, such a model is being introduced and optimized in the edge environments to efficiently services discovery while managing large volumes of data. However, effectively updating the multilevel index model by adding new services timely and precisely in the dynamic edge computing environments is still a challenge. Addressing this issue, this article proposes a designated key selection method to improve the efficiency of adding services in the multilevel index models. Our experimental results show that in the partial index and the full index of multilevel index model, our method reduces the service addition time by around 84% and 76%, respectively when compared with the original key selection method and by around 78% and 66%, respectively when compared with the random selection method. Our proposed method significantly improves the service addition efficiency in the multilevel index model, when compared with existing state‐of‐the‐art key selection methods, without compromising the service retrieval stability to any notable level.