In complex networks, identifying influential nodes is of great significance for their wide application. The proposed method integrates the correlation properties of local and global, and in terms of global features, the K-shell decomposition method of fusion degree is used to improve the actual discrimination degree of each node. In terms of local characteristics, the Solton index is introduced to effectively show the association relationship between each node and adjacent nodes. Through the analysis and comparison of multiple existing methods, it is found that the proposed method can identify key nodes more accurately so as to help quickly disintegrate the network. The final manual network verification also shows that this method is also suitable for the identification of important nodes of small-world networks and community networks.

To address the challenges faced by heterogeneous Unmanned Aerial Vehicle (UAV) systems in complex task allocation, including over-reliance on centralized scheduling, training deadlock, inadequate capture of temporal collaboration, and unstable training under sparse reward conditions, this paper proposes a distributed task allocation algorithm based on reinforcement learning. The algorithm adopts a decentralized decision-making architecture, which enables the autonomous formation of UAV collaborative groups without the need for a global scheduling center. A cascaded submission timeout mechanism is introduced to prevent training deadlock; the combination of Long Short-Term Memory (LSTM) and attention mechanism is employed to accurately model temporal correlations and collaborative dependencies; and the Proximal Policy Optimization (PPO) algorithm is leveraged to optimize the training stability under sparse reward conditions. Experimental results demonstrate that the proposed algorithm achieves a 100% task success rate in scenarios of different scales, and its key metrics, including makespan, time cost and waiting time, are significantly superior to those of mainstream baseline methods such as the Genetic Algorithm (GA) and the Hungarian Algorithm (HA). Moreover, the algorithm still maintains excellent robustness under the conditions of UAV failures, parameter variations, and dynamic task perturbations. This method supports zero-shot generalization for any number of UAVs and tasks and provides an efficient and reliable solution for the real-time collaborative scheduling of heterogeneous UAV systems.

With the widespread adoption of service-oriented architectures (SOA), services with the same functionality but the different Quality of Service (QoS) are proliferating, which is challenging the ability of users to build high-quality services. It is often costly for users to evaluate the QoS of all feasible services; therefore, it is necessary to investigate QoS prediction algorithms to help users find services that meet their needs. In this paper, we propose a QoS prediction algorithm called the MFDK model, which is able to fill in historical sparse QoS values by a non-negative matrix decomposition algorithm and predict future QoS values by a deep neural network. In addition, this model uses a Kalman filter algorithm to correct the model prediction values with real-time QoS observations to reduce its prediction error. Through extensive simulation experiments on the WS-DREAM dataset, we analytically validate that the MFDK model has better prediction accuracy compared to the baseline model, and it can maintain good prediction results under different tensor densities and observation densities. We further demonstrate the rationality of our proposed model and its prediction performance through model ablation experiments and parameter tuning experiments.

Dynamic identification of influential nodes in complex networks is of great significance for practical applications. In real-world scenarios, resources are often limited, making it necessary to evaluate nodes by iteratively assessing the remaining network after removing certain nodes. Therefore, a dynamic identification method for important nodes in complex networks is more suitable for real-world applications. This paper proposes a method that combines both local and global characteristics. For the global features, we introduce an improved k-shell method that integrates the fusion degree, enhancing the resolution of node rankings. For the local features, we introduce the Solton factor and the improved network constraint coefficient (INCC) to enhance the algorithm's understanding of the relationship between neighboring nodes. Through a comparison with existing methods, we find that the proposed KPDN-INCC method complements the KPDN method and accurately identifies important nodes, thus facilitating rapid network disintegration. The experiments on artificial networks further validate the effectiveness of the proposed method in identifying important nodes in small-world networks with a random parameter less than 0.4.