Although multimodal feature fusion technology in fake news detection can integrate complementary information from different modal data, the semantic inconsistency of multimodal features will lead to feature fusion difficulties. And there is the problem of information loss during one fusion process. In addition, although it is possible to improve the detection effect by increasing the support of external evidence in fake news detection, there is a lag in obtaining external evidence and the reliability and completeness of the evidence source is difficult to guarantee. Additional noise may be introduced to interfere with the model judgment. Therefore, a cross-modal fake news detection method (CM-MLF) based on evidence-free multilevel fusion is proposed. The method solves the semantic inconsistency problem by utilizing cross-modal alignment processing. And it utilizes the attention mechanism to perform multilevel fusion of text and image features without the assistance of other evidential features to further enhance the expressive power of the features. Experiments show that the method achieves better detection results on multiple benchmark datasets, effectively improving the accuracy and robustness of cross-modal fake news detection.
To meet the growing computational demands of expanding intelligence application scenarios, computing networks are becoming increasingly complex. However, operational challenges such as frequent node online/offline events and dynamic link status changes significantly complicate the coordinated scheduling of computational and transmission resources. Furthermore, traditional static optimization methods exhibit stability issues and slow convergence in medium-scale dynamic networks, limiting their ability to satisfy low-latency and high-reliability requirements for complex services. Therefore, we propose a dynamic computing network transmission optimization method that integrates Dynamic Graph Neural Networks (DGNN), dual virtual queues, and Proximal Policy Optimization (PPO) with Nesterov momentum acceleration. This approach aims to optimize network transmission performance during frequent node changes. This approach employs DGNN for real-time modeling of dynamic topology and node load characteristics, utilizes a dual virtual queue mechanism to characterize stability constraints of computational and transmission loads, and incorporates Nesterov momentum during policy optimization to enhance convergence speed and stability of policy updates. Simulation experiments indicate that the proposed method outperforms comparison models in queue stability, convergence performance, and quality of service, thereby improving transmission efficiency in dynamic computing networks.
With the continuous emergence of intelligent network applications and complex tasks for mobile terminals, the traditional single computing model often fails to meet the greater requirements of computing and network technology, thus promoting the formation of a new computing power network architecture, of ‘cloud, edge and end’ three-level heterogeneous computing. For complex divisible computing tasks in the network, task decomposition and offloading help to realize a distributed execution of tasks, thus reducing the overall running time and improving the utilization of fragmented resources in the network. However, in the process of task decomposition and offloading, there are problems, such as there only being a single method of task decomposition; that too large or too small decomposition granularity will lead to an increase in transmission delay; and the pursuit of low-delay and low-energy offloading requirements. Based on this, a complex divisible computing task decomposition and offloading scheme is proposed. Firstly, the computational task is decomposed into multiple task elements based on code partitioning, and then a density-peak-clustering algorithm with an improved adaptive truncation distance and clustering center (ATDCC-DPC) is proposed to cluster the task elements into subtasks based on the task elements themselves and the dependencies between the task elements. Secondly, taking the subtasks as the offloading objects, the improved Double Deep Q-Network subtask offloading algorithm (ISO-DDQN) is proposed to find the optimal offloading scheme that minimizes the delay and energy consumption. Finally, the proposed algorithms are verified by simulation experiments, and the scheme in this paper can effectively reduce the task delay and energy consumption and improve the service experience.