Object detection has a wide range of applications in forestry pest control. However, forest pest detection faces the challenges of a lack of datasets and low accuracy of small target detection. DETR is an end-to-end object detection model based on the transformer, which has the advantages of simple structure and easy migration. However, the object query initialization of DETR is random, and random initialization will cause the model convergence to be slow and unstable. At the same time, the correlation between different network layers is not strong, resulting in DETR is not very ideal in small object training, optimization, and performance. In order to alleviate these problems, we propose Skip DETR, which improves the feature fusion between different network layers through skip connection and the introduction of spatial pyramid pooling layers so as to improve the detection results of small objects. We performed experiments on Forestry Pest Datasets, and the experimental results showed significant AP improvements in our method. When the value of IoU is 0.5, our method is 7.7% higher than the baseline and 6.1% higher than the detection result of small objects. Experimental results show that the application of skip connection and spatial pyramid pooling layer in the detection framework can effectively improve the effect of small-sample obiect detection.

Mobile edge computing is emerging to provide cloud-computing capabilities to mobile users, so that they can offload computation intensive tasks to close proximity for execution. However, most existing works imply that a transmission-finished task still occupies the channel until all users on the same channel finish the transmission, leading to severe channel resource waste. To solve this problem, we propose an efficient computation offloading mechanism which releases the channel resources of transmission-finished tasks for transmission-unfinished tasks, and aims to minimize the response time and energy consumption for each user. Specifically, we formulate the computation offloading problem as a game, analyze its structural properties and show how it possesses a Nash equilibrium and admits the finite improvement property, in the cases of elastic cloud and non-elastic cloud respectively. We then propose a Distributed Multi-channel Computation Offloading (DMCO) algorithm, which can converge to a Nash equilibrium, and find the upper bound of the convergence time. We further evaluate the performance of DMCO using the price of anarchy. Numerical results show that DMCO scales well with the number of users, and outperforms existing works, for example, benefits 13.3% more users and reduces cost by 23.7% than CO, one of the best existing works.

Task offloading could optimize computational resource utilization in edge computing environments. However, how to assign and offload tasks for different behavior users is an essential problem since the systems dynamic, intelligent application diversity, and user personality. With user behavior prediction, this paper proposes soCoM, a semi-online Computational Offloading Model. We explore the user behaviors in sophisticated action space by reinforcement learning for catching unknown environment information. With Dueling Deep-Q Network, both the prediction accuracy of users’ behaviors and the server load balance are well-considered, while increasing the computational efficiency and decreasing the resource costing. We propose a dynamic simulation environment of edge computing to demonstrate that user behavior is the critical factor for impacting system utilization. As the action space increasing, Dueling DQN performs better than state-of-art DQN and other improved strategies, and also load balance in multiple different server scenario.

Federated Learning (FL) enables decentralized data utilization while maintaining edge user privacy, but it faces challenges due to statistical heterogeneity. Existing approaches address client drift and data heterogeneity issues. However, real-world settings often involve low-quality data with noisy features, such as covariate drift or adversarial samples, which are usually ignored. Noisy samples significantly impact the global model’s accuracy and convergence rate. Assessing data quality and selectively aggregating updates from high-quality clients is crucial, but dynamically perceiving data quality without additional computations or data exchanges is challenging. In this paper, we introduce the FedDQA (Federated learning via Data Quality-Aware) (FedDQA) framework. We discover increased data noise leads to slower loss reduction during local model training. We propose a loss sharpness-based Data-Quality-Awareness (DQA) metric to differentiate between high-quality and low-quality data. Based on the DQA, we design a client selection algorithm that strategically selects participant clients to reduce the negative impact of noisy clients. Experiment results indicate that FedDQA significantly outperforms the baselines. Notably, it achieves up to a 4% increase in global model accuracy and demonstrates faster convergence rates.