Most of the existing Knowledge Graph Completion （KGC） methods do not fully exploit the relational paths in the triple structure， and only consider the graph structure information； meanwhile， the existing models focus on considering the neighborhood information in the process of entity aggregation， and the learning of relations is relatively simple. To address the above problems， a graph attention model that integrates directed relations and relational paths was proposed， namely DRPGAT. Firstly， the regular triples were converted into directed relationship-based triples， and the attention mechanism was introduced to give different weights to different directed relationships， so as to realize the entity information aggregation. At the same time， the relational path model was established， and the relational positions were embedded into the path information to distinguish the relationships among different positions. And the irrelevant paths were filtered to obtain the useful path information. Secondly， the attention mechanism was used to carry out deep path information learning to realize the aggregation of relations. Finally， the entities and relations were fed into the decoder and trained to obtain the final completion results. Link prediction experiments were conducted on two real datasets to verify the effectiveness of the proposed model. Experimental results show that compared to the optimal results of the baseline models， on FB15k-237 dataset， DRPGAT has the Mean Rank （MR） reduced by 13， and the Mean Reciprocal Rank （MRR）， Hits@1， Hits@3， and Hits@10 improved by 1.9， 1.2， 2.3， and 1.6 percentage points， respectively； on WN18RR dataset， DRPGAT has the MR reduced by 125， and the MRR， Hits@1， Hits@3， and Hits@10 improved by 1.1， 0.4， 1.2， and 0.6 percentage points， respectively， indicating the effectiveness of the proposed model.

Concerning the poor performance problem of crowd counting tasks in different dense scenes caused by severe scale changes and occlusions, a new Multi-scale spatial Attention Feature fusion Network (MAFNet) was proposed based on the Congested Scene Recognition Network (CSRNet) by combining the multi-scale feature fusion structure and the spatial attention module. Before extracting features with MAFNet, the scene images with head markers were processed with the Gaussian filter to obtain the ground truth density maps of images. In addition, the method of jointly using two basic loss functions was proposed to constrain the consistency of the density estimation map and the ground truth density map. Next, with the multi-scale feature fusion structure as the backbone of MAFNet, the strategy of extracting and fusing multi-scale features simultaneously was used to obtain the multi-scale fusion feature map, then the feature maps were calibrated and refused by the spatial attention module. After that, an estimated density image was generated through dilated convolution, and the number of people in the scene was obtained by integrating the estimated density image pixel by pixel. To verify the effectiveness of the proposed model, evaluations were conducted on four datasets (ShanghaiTech, UCF_CC_50, UCF_QRNF and World-Expo'10). Experimental results on ShanghaiTech dataset PartB show that, compared with CSRNet, MAFNet has a Mean Absolute Error (MAE) reduction of 34.9% and a Mean Square Error (MSE) reduction of 29.4%. Furthermore, experimental results on multiple datasets show that by using the attention mechanism and multi-scale feature fusion strategy, MAFNet can extract more detailed information and reduce the impact of scale changes and occlusions.

To seek a good balance between efficiency and fairness in emergency relief supply allocation, a high-dimensional multi-objective adaptive allocation algorithm based on two-dimensional integer encoding was developed. First of all, a high-dimensional multi-objective optimization model was constructed with the consideration of total emergency response time, panic degree of the victims, unsatisfactory degree of relief supplies, fairness of supply allocation, loss of the victims, and total cost of emergency response. Then, two-dimensional integer encoding and Adaptive Individual Repair (AIR) were adopted to resolve potential emergency resource conflicts. Finally, the shift-based density estimation and Strength Pareto Evolutionary Algorithm 2 (SPEA2) were introduced to design a high-dimensional multi-objective allocation algorithm for disaster relief supplies. Simulation results show that compared with Encoding Repair and Non-dominated Sorting based Differential Evolution algorithm (ERNS-DE) and Greedy-Search-based Multi-Objective Genetic Algorithm (GSMOGA), the proposed algorithm had coverage values increased by 34.87%, 100% and 23.59%, 100% in two emergency environments, respectively. Moreover, the hypervolume values of the proposed algorithm were much higher than those of the two comparison algorithms. Experimental results verify that the proposed model and algorithm allow decision makers to select emergency schemes according to actual emergency needs, and have better flexibility and efficiency.

To reduce the influence of factors such as illumination variation, scale variation, partial occlusion in target tracking, a target tracking algorithm based on Kernelized Correlation Filter (KCF) with block-based model was proposed. Firstly, the feature of histogram of oriented gradients and the feature of color name were combined to better characterize the target. Secondly, the method of scale pyramid was adopted to estimate the target scale. Finally, the peak to sidelobe ratio of the feature response map was used to detect occlusion, and the partial occlusion problem was solved by introducing a high-confidence block relocation module and a dynamic strategy for model adaptive updating. To verify the effectiveness of the proposed algorithm, comparative experiments with several mainstream algorithms on various datasets were conducted. Experimental results show that the proposed algorithm has the highest precision and success rate which are respectively 11.89% and 15.24% higher than those of KCF algorithm, indicating that the proposed algorithm has stronger robustness in dealing with factors like illumination variation, scale variation and partial occlusion.

To solve the problems of low collection performance, poor wear leveling effect, and high memory overhead in the existing NAND flash memory garbage collection algorithms, a new garbage collection algorithm based on logical region heat was proposed. The heat calculation formula was redefined, the NAND memory of continuous logical address was defined as a heat range which was used to replace the heat of logical page, then the data with different heat was separated into the corresponding flash blocks with different erase counts. The cold and hot data were effectively separated,and the memory space was also saved. Meanwhile, a new collection cost function was constructed to improve the collection efficiency and wear leveling effect. The experimental results showed that compared with the excellent File-aware Garbage Collection (FaGC) algorithm, the total number of erase operations was reduced by 11%, the total number of copy operations was reduced by 13%, the maximum difference of erase counts was reduced by 42%, and the memory consumption was reduced by 75%. Therefore, the available flash memory space can be increased, the read and write performance of flash memory can be improved, and the flash memory life can be also extended by using the proposed algorithm.

According to the problem of the existing garbage collection algorithm for NAND flash memory, an efficient algorithm, called AWGC (Age With Garbage Collection), was presented to improve wear leveling of NAND flash memory. A hybrid policy with the age of invalid page, erase count of physical blocks and the update frequency of physical blocks were redefined to select the returnable block. Meanwhile, a new heat calculation method logic pages was deduced, and cold-hot separating of valid pages in returnable block was conducted. Compared with the GReedy (GR) algorithm, Cost-Benefit (CB) algorithm, Cost-Age-Time (CAT) algorithm and File-aware Garbage Collection (FaGC) algorithm, not only some good results in wear leveling have been got, but also the total numbers of erase and copy operations have significantly been reduced.

In this paper, the military Petrol-Oil and Lubricants (POL) allotment and transportation problem was studied by introducing the concept of support time window. Considering the complicated restrictions of POL support time and transportation capability, the POL allotment and transportation model based on multiple time windows was proposed by using Constraint Satisfaction Problem (CSP) modelling approach. Firstly, the formalized description of the problem elements was presented, such as POL support station, demand unit, support time window, support demand, and support task. Based on the formalized description, the CSP model for POL support was constructed. The multi-objective model was transformed into single-objective one by using perfect point method. Finally, the solving procedure and its steps were designed based on Particle Swarm Optimization (PSO) algorithm, and an arithmetic example was followed to demonstrate the application of the method. In the example, the two optimization schemes obtained by the model given in this paper and got by the model in which the objective is maximizing the quantity supported were compared. In the two schemes, the transportation capacity both reached a maximum utilization, but the start supporting time of each POL demand in the scheme of the proposed method was no later than the one in the scheme of the single-objective model. By comparing different optimization schemes, it is shown that the proposed model and algorithm can effectively solve the multi-objective POL support optimization problem.

Concerning the vulnerability to attack from external and internal nodes and node failure due to openness and limited resources in Wireless Sensor Network (WSN), an efficient, secure trusted authentication scheme was proposed. The theory of identity-based and bilinear pairings was adopted in the authentication key agreement and update. The node trust value was computed by node behavior reputation management based on Beta distribution. The symmetric cryptosystem combined with message authentication code was used in certification process between trusted nodes which were identified by the trust value. The scheme not only can prevent eavesdropping, injection, replay, denial of service and other external attacks, but also is able to withstand internal threats such as the selective forwarding, Wormhole attack, Sinkhole attack and Sybil attack. The analysis and comparison with SPINS scheme show that the scheme can achieve longer network lifetime, smaller certification delay, greater security and scalability in the same network environment. The scheme has good application value in unattended WSN with high safety requirements.

Focused on the requirements of low cost and low power in Wireless Sensor Network (WSN), this paper proposed a range-free localization algorithm based on Support Vector Machine (SVM) classification regions. First, SVM constructed a binary decision tree classifier via learning of the training data. Then the classifier determined the certain classification region where the unknown nodes were located. Finally, the study used the region's center point as the estimated position of the unknown node. The proposed algorithm required mere connectivity information (i.e., hop counts only), so as to reduce the network cost and communication load. The simulation results show that this algorithm alleviates the coverage holes and border problem significantly while certain location accuracy is assured.