Identifying the vital nodes in networks is of great significance for understanding the function of nodes and the nature of networks. Many centrality indices, such as betweenness centrality (BC), eccentricity centrality (EC), closeness centricity (CC), structural holes (SH), degree centrality (DC), PageRank (PR) and eigenvector centrality (VC), have been proposed to identify the influential nodes of networks. However, some of these indices have limited application scopes. EC and CC are generally only applicable to undirected networks, while PR and VC are generally used for directed networks. To design a more applicable centrality measure, two vital node identification algorithms based on node adjacency information entropy are proposed in this paper. To validate the effectiveness and applicability of the proposed algorithms, contrast experiments are conducted with the BC, EC, CC, SH, DC, PR and VC indices in different kinds of networks. The results show that the index in this paper has a high correlation with the local metric DC, and it also has a certain correlation with the PR and VC indices for directed networks. In addition, the experimental results indicate that our algorithms can effectively identify the vital nodes in different networks.

Large volumes of data collected by the Automatic Identification System (AIS) provide opportunities for studying both single vessel motion behaviours and collective mobility patterns on the sea. Understanding these behaviours or patterns is of great importance to maritime situational awareness applications. In this paper, we leveraged AIS trajectories to discover vessel spatio-temporal co-occurrence patterns, which distinguish vessel behaviours simultaneously in terms of space, time and other dimensions (such as ship type, speed, width etc.). To this end, available AIS data were processed to generate spatio-temporal matrices and spatio-temporal tensors (i.e., multidimensional arrays). We then imposed a sparse bilinear decomposition on the matrices and a sparse multi-linear decomposition on the tensors. Experimental results on a real-world dataset demonstrated the effectiveness of this methodology, with which we show the existence of connection among regions, time, and vessel attributes.

In recent years, cyber attacks have shown diversified, purposeful, and organized characteristics, which pose significant challenges to cyber defense decision-making on internal networks. Due to the continuous confrontation between attackers and defenders, only using data-based statistical or supervised learning methods cannot cope with increasingly severe security threats. It is urgent to rethink network defense from the perspective of decision-making, and prepare for every possible situation. Reinforcement learning has made great breakthroughs in addressing complicated decision-making problems. We propose a framework that defines four modules based on the life cycle of threats: pentest, design, response, recovery. Our aims are to clarify the problem boundary of network defense decision-making problems, to study the problem characteristics in different contexts, to compare the strengths and weaknesses of existing research, and to identify promising challenges for future work. Our work provides a systematic view for understanding and solving decision-making problems in the application of reinforcement learning to cyber defense.

Efficient scheduling for the supporting operations of aircrafts in flight deck is critical to the aircraft carrier, and even several seconds’ improvement may lead to totally converse outcome of a battle. In the paper, we ameliorate the supporting operations of carrier-based aircrafts and investigate three simultaneous operation relationships during the supporting process, including precedence constraints, parallel operations, and sequence flexibility. Furthermore, multifunctional aircrafts have to take off synergistically and participate in a combat cooperatively. However, their takeoff order must be restrictively prioritized during the scheduling period accorded by certain operational regulations. To efficiently prioritize the takeoff order while minimizing the total time budget on the whole takeoff duration, we propose a novel mixed integer liner programming formulation (MILP) for the flight deck scheduling problem. Motivated by the hardness of MILP, we design an improved differential evolution algorithm combined with typical local search strategies to improve computational efficiency. We numerically compare the performance of our algorithm with the classical genetic algorithm and normal differential evolution algorithm and the results show that our algorithm obtains better scheduling schemes that can meet both the operational relations and the takeoff priority requirements.

Research on recommendation methods using multimodal graph information presents a significant challenge within the realm of information services. Prior studies in this area have lacked precision in the purification and denoising of multimodal information and have insufficiently explored fusion methods. We introduce a multimodal graph recommendation approach leveraging cross-attention fusion. This model enhances and purifies multimodal information by embedding the IDs of items and their corresponding interactive users, thereby optimizing the utilization of such information. To facilitate better integration, we propose a cross-attention mechanism-based multimodal information fusion method, which effectively processes and merges related and differential information across modalities. Experimental results on three public datasets indicated that our model performed exceptionally well, demonstrating its efficacy in leveraging multimodal information.