In the military field, decision making has become the core of the new operational concept, known as the “kill web”. Although the theory of kill web has been widely recognized by many countries, the decision-making methods for the kill web are still in the early stage. Therefore, there is a need for a new decision-making method for the kill web. Firstly, different from the traditional scheme decision, the kill web is a complex system. The method of complex network provides a new perspective on complex systems, so the kill web was modeled based on complex network. Secondly, the kill web relies on artificial intelligence to provide decision-makers with operation loop solutions, and then decision-makers rely on the experience to make a final decision. However, the current decision-making methods only consider one of the intelligent and human decision-making methods, while the kill web needs to consider both. Hence, we combined intelligent decision making with human decision making through multi-objective optimization and the prospect theory. Finally, we designed a nondominated sorting ant colony genetic algorithm-II (NSACGA-II) to solve large-scale problems, since the kill web is a large-scale system. In addition, an illustrative case was used to verify the feasibility and effectiveness of the proposed model. The results showed that, compared with other classical multi-objective optimization algorithms, the NSACGA-II is superior to other superior algorithms in terms of the hypervolume (HV) and spacing (SP), which verifies the effectiveness of the method and greatly improves the quality of commanders’ decision-making.

Current graph-embedding methods mainly focus on static homogeneous graphs, where the entity type is the same and the topology is fixed. However, in real networks, such as academic networks and shopping networks, there are typically various types of nodes and temporal interactions. The dynamical and heterogeneous components of graphs in general contain abundant information. Currently, most studies on dynamic graphs do not sufficiently consider the heterogeneity of the network in question, and hence the semantic information of the interactions between heterogeneous nodes is missing in the graph embeddings. On the other hand, the overall size of the network tends to accumulate over time, and its growth rate can reflect the ability of the entire network to generate interactions of heterogeneous nodes; therefore, we developed a graph dynamics model to model the evolution of graph dynamics. Moreover, the temporal properties of nodes regularly affect the generation of temporal interaction events with which they are connected. Thus, we developed a node dynamics model to model the evolution of node connectivity. In this paper, we propose DHGEEP, a dynamic heterogeneous graph-embedding method based on the Hawkes process, to predict the evolution of dynamic heterogeneous networks. The model considers the generation of temporal events as an effect of historical events, introduces the Hawkes process to simulate this evolution, and then captures semantic and structural information based on the meta-paths of temporal heterogeneous nodes. Finally, the graph-level dynamics of the network and the node-level dynamics of each node are integrated into the DHGEEP framework. The embeddings of the nodes are automatically obtained by minimizing the value of the loss function. Experiments were conducted on three downstream tasks, static link prediction, temporal event prediction for homogeneous nodes, and temporal event prediction for heterogeneous nodes, on three datasets. Experimental results show that DHGEEP achieves excellent performance in these tasks. In the most significant task, temporal event prediction of heterogeneous nodes, the values of precision@2 and recall@2 can reach 30.23% and 10.48% on the AMiner dataset, and reach 4.56% and 1.61% on the DBLP dataset, so that our method is more accurate at predicting future temporal events than the baseline.

Mosaic warfare is a combat technique that involves distributed kill webs, which are dynamic networks of sensors and weapons. However, modeling and analyzing these networks requires intelligent technologies that can handle data scarcity and uncertainty. This study proposes a graph generation method called the generator model for temporal dynamic graph (GMTDG) that uses weak temporal point processes and autoregressive modeling to create realistic dynamic kill web graphs based on limited observations. We use a time encoding method based on the Bochner theorem to represent time effectively. We evaluated our method on three large-scale dynamic networks and showed that it can generate graphs with similar but different properties from the source graphs. We also applied our method to a real battle network and demonstrated its usefulness for generating temporal dynamic kill web that match the characteristics of mosaic warfare networks.

Repository-level bug localization-the task of identifying where code must be modified to fix a bug-is a critical software engineering challenge. Standard Large Language Modles (LLMs) are often unsuitable for this task due to context window limitations that prevent them from processing entire code repositories. As a result, various retrieval methods are commonly used, including keyword matching, text similarity, and simple graph-based heuristics such as Breadth-First Search. Graph Neural Networks (GNNs) offer a promising alternative due to their ability to model complex, repository-wide dependencies; however, their application has been hindered by the lack of a dedicated benchmark. To address this gap, we introduce GREPO, the first GNN benchmark for repository-scale bug localization tasks. GREPO comprises 86 Python repositories and 47294 bug-fixing tasks, providing graph-based data structures ready for direct GNN processing. Our evaluation of various GNN architectures shows outstanding performance compared to established information retrieval baselines. This work highlights the potential of GNNs for bug localization and established GREPO as a foundation resource for future research, The code is available at https://github.com/qingpingmo/GREPO.