Search

Meta-heuristic algorithms have the advantages of resilience, global optimization capacity, and coding flexibility, making them helpful in tackling difficult optimization issues. The enhanced wind-driven optimization (CHTWDO) that was proposed in this paper coupled the chaotic map approach and the hyperbolic tangent with the T-distribution mutation method. The initial air particles are evenly distributed in the system space through a tent mapping strategy. Meanwhile, the variation probability of the hyperbolic tangent model and the T-distribution variation method are used to improve the comprehensive performance of the algorithm. In this way, the global search accuracy and the ability of avoiding the extreme value of the algorithm can be taken into account. Combining the three strategies, CHTWDO had higher global search accuracy and a stronger ability to jump out of local extremum. Comparing with the eight meta-heuristic algorithms (including WDO) and the single strategy improved WDO on 24 test functions, the experimental results show that CHTWDO with two improved strategies has better convergence precision and faster convergence speed. Statistical tests such as Friedman's and Wilcoxon's rank-sum tests are used to determine significant differences between these comparison algorithms. Finally, CHTWDO also obtains the best results on four classical optimization problems in engineering applications, which verifies its practicality and effectiveness. [ABSTRACT FROM AUTHOR]

This paper proposes an interactive two-archive method to solve many-objective optimization problems. Two updating strategies based on the aggregation-based framework are presented and incorporated into a two-archive framework. In addition, we further extend this method by introducing an interactive mechanism in which evolutionary information is passed from the diversity archive to the convergence archive. Given the requirement to balance convergence and diversity, a mating selection method is proposed to regulate the evolutionary speed of these two archives collaboratively. The proposed algorithm has been tested extensively on several problems with different peer algorithms to validate its effectiveness. The results show that the proposed method can outperform several state-of-the-art evolutionary algorithms for handling many-objective optimization. [ABSTRACT FROM AUTHOR]

The minimum spanning tree (MST) is widely used in planning the most economical network. The algorithm for finding the MST of a connected graph is essential. In this paper, a new algorithm for finding MST is proposed based on a deduced theorem of MST. The algorithm first sorts the edges in the graph according to their weight, from large to small. Next, on the premise of ensuring the connectivity of the graph, it deletes the edges in this order until the number of edges of the graph is equal to the number of vertexes minus 1. Finally, the remaining graph is an MST. This algorithm is equivalent to an inverse Kruskal algorithm. For sparse graphs, the proposed algorithm has higher efficiency than the Kruskal algorithm. Experiments and analysis verify the effectiveness of the algorithm proposed in this paper. The algorithm provides a better choice for finding the MST of the sparse graph. [ABSTRACT FROM AUTHOR]

To improve soldiers' combat capability, weapon arms have a good development prospect. However, due to special work scenarios and tasks, new requirements are exerted on. Based on the fast-expanding random tree algorithm (RRT), path algorithm optimization (RRT-H) is proposed for the path planning of weapon arms. Overall path optimization is achieved by reducing the local path length with a closer path point planning to the obstacle. In a complex environment, the RRT-H algorithm can avoid local traps by guiding the new path extension direction and exploring multiple different paths in the map. The superiority of this algorithm is verified with 2D plane obstacle avoidance and pathfinding simulation experiments. Compared to RRT ∗ , RRT ∗ smart, and information RRT ∗ , the RRT-H can obtain high-quality calculation results in a shorter time. After setting degrees of freedom (DOF) as that of variables, the algorithm is applied to the 4-DOF weapon arm, which confirms an effective reduction to the 4-DOF weapon arm's motion costs. [ABSTRACT FROM AUTHOR]

This paper takes the flying defense team as the operating unit and studies the route planning and tasks in the process of plant protection operations as system problems. In the route planning, the flight defense team's operating time is used as the optimization goal of route planning. Taking the UAV battery and drug load as constraints, the flight mission is divided into subtasks that can be completed by a single UAV in a single flight. On this basis, the particle swarm algorithm is used to optimize the task allocation, so as to achieve the goal of UAV plant protection route and task division with minimum time loss. In order to verify the effectiveness of the method in this paper, 3 and 4 UAVs flying defense teams were used as the experimental objects, and experiments were carried out in large and small field groups. In terms of time consumption, the method in this paper is compared with the unit operation area method and the single size method. The energy consumption advantage is weaker than time consumption. In terms of time consumption, the method in this paper can greatly improve the efficiency of large-area operation areas. Compared with the unit operation area method, 3 drones can increase the efficiency by 58.98%, which is increased by 10.22% compared with the unit size method. The efficiency of 4 units can be increased by 58.08% compared with the unit operation area method, and the efficiency is increased by 10.22% compared with the unit size method. [ABSTRACT FROM AUTHOR]

In this paper, a novel UAV path planning algorithm based on improved cellular ant colony algorithm and dynamic window algorithm (ICACO-IDWA) is proposed to solve the problem of dynamically changing threat during actual flight. The main innovations of this paper are as follows. (a) The hexagon grid method is proposed to model the UAV flight space, which solves the problem of inconsistent simulation time step. (b) A novel ICACO-IDWA algorithm is proposed. In the first stage, the optimal path is obtained by the improved cellular ant colony algorithm (ICACO). In the second stage, the improved dynamic window algorithm (IDWA) is used to optimize the optimal path considering dynamic threat. Through the algorithm, the UAV path planning with dynamic threat change is realized. Finally, simulation results verify the effectiveness of the proposed model and algorithm. [ABSTRACT FROM AUTHOR]

The identification of disruptive technologies is intended to focus on training and incubation in advance and is an important means to accelerate the upgrading of industrial structure and the transformation of developmental mode and seize the commanding heights of future development. Based on summarizing the existing major identification methods of disruptive technologies, this paper concludes the rule that "disruptive technologies are always at the root node of a certain classification in the deeply classified technology development network". It also proposes a new algorithm to use term frequency-inverse document frequency technology and a patented Subject-Action-Object structure to extract technical features, develop networks based on similarity matrix generation technology, and identify subversive technologies based on the depth classification model. Using patent data, it is found that the technology development network generated by the algorithm proposed in this paper can effectively show the trajectory of technology development by fitting the patent citation relationship. Through this algorithm, we have successfully identified technologies that have had disruptive effects in the field and verified the effectiveness of this algorithm. [ABSTRACT FROM AUTHOR]

Recently, the same authors provided a switching algorithm for the preferred clock skew estimator appropriate for the precision time protocol (PTP) scenario. The algorithm chooses the one-way delay (OWD) clock skew estimator for the Forward path or the Reverse path or the two-way delay (TWD) clock skew estimator that has the best performance in the mean square error (MSE) perspective. However, the switching algorithm applies only to the Gaussian scenario. In a real system, the packet delay variation (PDV) can be characterized as an fractional Gaussian noise (fGn) process where the Hurst exponent parameter can also have values higher than 0.5. Thus, the Gaussian case-switching algorithm may not apply in a real system where after a small set of PTP measurements, the switching algorithm should be able to switch effectively to the preferred clock skew estimator with the best performance in the MSE perspective. In this paper, the PDV is characterized as an fGn process where the Hurst exponent (H) is in the range of 0.5 ≤ H < 1. We estimate the unknown PDV variances and the Hurst exponent parameters of the Forward and Reverse paths. These estimated parameters are used for switching to the preferred clock skew estimator from the MSE perspective, even in the presence of asymmetry in the PDV or in the Hurst exponent parameters. We also detect and alarm for the unexpected load, cyber-attack, or clock skew deviation that can occur in a real system. [ABSTRACT FROM AUTHOR]

Neural network is a supervised classification algorithm which can deal with high complexity and nonlinear data analysis. Supervised algorithm needs some known labels in the training process, and then corrects parameters through backpropagation method. However, due to the lack of marked labels, existing literature mostly uses Auto-Encoder to reduce the dimension of data when facing of clustering problems. This paper proposes an RBF (Radial Basis Function) neural network clustering algorithm based on K-nearest neighbors theory, which first uses K-means algorithm for preclassification, and then constructs self-supervised labels based on K-nearest neighbors theory for backpropagation. The algorithm in this paper belongs to a self-supervised neural network clustering algorithm, and it also makes the neural network truly have the ability of self-decision-making and self-optimization. From the experimental results of the artificial data sets and the UCI data sets, it can be proved that the proposed algorithm has excellent adaptability and robustness. [ABSTRACT FROM AUTHOR]

Falls cause great harm to people, and the current, more mature fall detection algorithms cannot be well-migrated to the embedded platform because of the huge amount of calculation. Hence, they do not have a good application. A lightweight fall detection algorithm based on the AlphaPose optimization model and ST-GCN was proposed. Firstly, based on YOLOv4, the structure of GhostNet is used to replace the DSPDarknet53 backbone network of the YOLOv4 network structure, the path convergence network is converted into BiFPN (bidirectional feature pyramid network), and DSC (deep separable convolution) is used to replace the standard volume of spatial pyramid pool, BiFPN, and YOLO head network product. Then, the TensorRt acceleration engine is used to accelerate the improved and optimized YOLO algorithm. In addition, a new type of Mosaic data enhancement algorithm is used to enhance the pedestrian detection algorithm, improving the effect of training. Secondly, use the TensorRt acceleration engine to optimize attitude estimation AlphaPose model, speeding up the inference speed of the attitude joint points. Finally, the spatiotemporal graph convolution (ST-GCN) is applied to detect and recognize actions such as falls, which meets the effective fall in different scenarios. The experimental results show that, on the embedded platform Jeston nano, when the image resolution is 416 × 416, the detection frame rate of this method is stable at about 8.33. At the same time, the accuracy of the algorithm in this paper on the UR dataset and the Le2i dataset has reached 97.28% and 96.86%, respectively. The proposed method has good real-time performance and reliable accuracy. It can be applied in the embedded platform to detect the fall state of people in real time. [ABSTRACT FROM AUTHOR]

Since there is a close relationship between network information security attack events and time complexity, it is necessary to count the degree of correlation between the current connection record and the connection record within a certain period of time before. Only in this way can the relationship between network connection data and network information security attack events be better reflected. In this paper, a rough Fourier fast algorithm based on rough set theory is proposed. Based on the characteristic attributes of the intrusion detection data set with the most value of character attributes as the data division basis, the computer network intrusion anomaly detection data set is intelligently divided into small data sets, so as to carry out attribute reduction. The network intrusion detection rule update experiment adopts the misuse detection method, extracts some samples from the KDD99 data set for training, obtains the computer network intrusion detection rules in the hierarchical decision table, and uses the incremental learning algorithm to update the rules, compared with the intrusion detection rules expressed by the decision table to test the feasibility and effectiveness of the rule update, and compared with the improved RSDB, RE-RFE algorithm, and KNN algorithm to evaluate the effect of the rough Fourier fast detection model applied to the problem of network intrusion anomaly detection. Using the attribute subset reduced by the rough Fourier algorithm to perform classification and modeling of computer network intrusion anomaly detection is significantly reduced, and the average time is reduced by 0.09 seconds, and this paper lays a good foundation for the application of network security intrusion detection algorithm. [ABSTRACT FROM AUTHOR]

In this paper, the existing scenic spot recommendation algorithms ignore the implicit trust and trust transmission of users when dealing with user relationships, and the lack of historical browsing behavior data of users in new city scenes leads to an inaccurate recommendation. In this paper, a personalized scenic spot recommendation method combining user trust relationship and tag preference is proposed. Firstly, the trust degree is introduced when the recommendation quality is poor only considering the similarity of users. By mining the implicit trust relationship of users, the problem that the existing research cannot make recommendations when the direct trust is difficult to obtain is solved, and the data sparsity and cold start problems are effectively alleviated. Secondly, in the process of user interest analysis, the relationship between scenic spots and tags is extended to the relationship among users, scenic spots and tags, and users' interest preferences are decomposed into long-term preferences for different scenic spots tags, which effectively alleviates the problem of poor recommendation quality when users' historical tour records are lacking. The personalized tourism recommendation method proposed in this paper effectively integrates many features of social networks and effectively alleviates the problems of data sparseness and feature learning in tourism recommendation based on social networks by using vectorization and deep learning technology. Its research has very important usage scenarios and commercial value in the tourism industry. This model can efficiently mine the association rules between scenic spots in multisource information data. The experimental results show that mining the correlation between the scenic spots selected by tourists can provide effective information for tourism decision-making. [ABSTRACT FROM AUTHOR]

In recent years, an increasing number of population-based metaheuristic algorithms have been proposed to solve the flexible job-shop scheduling problem (FJSP) according to its practicality and complexity. Most of these algorithms are single-population-based and hence are very susceptible to becoming trapped in local optimal values. Thus, multipopulation methods are widely used to improve these algorithms, resulting in multipopulation algorithms. These multipopulation algorithms have been widely studied in the context of single-layer complex networks recently. However, coupled networks used to control two (or more) algorithms simultaneously to get a better algorithm are always ignored in literature. Therefore, in this paper, using coupled scale-free networks (with different scaling exponents) to control the genetic algorithm (GA) and the invasive weed optimization (IWO) simultaneously, a multipopulation GA/IWO with coupled scale-free networks (MPGAIWO-SF) is proposed to solve FJSP. Then, we study how some parameters (e.g., subpopulation size, subpopulation number, and scaling exponent) of MPGAIWO-SF affect its performance, which is also ignored in literature. The simulation results illustrate that (1) the performance of MPGAIWO-SF is significantly improved compared with that of GA and IWO; (2) as the subpopulation size increases, the performance of MPGAIWO-SF first becomes better and then remains almost unchanged; (3) as the subpopulation number increases, the performance of MPGAIWO-SF first becomes better and then decreases rapidly; and (4) the performance of MPGAIWO-SF becomes worse slightly as the scaling exponent decreases. Finally, solving more FJSP instances, the MPGAIWO-SF with optimized parameters is compared with other related algorithms to verify its effectiveness. [ABSTRACT FROM AUTHOR]

It is very important for power grid development research and related technical improvement to obtain the disaster situation of fine-scale distribution network, such as the transportation condition evaluation of distribution network and the wind waterlogging disaster prediction of distribution network. Among them, the wind waterlogging disaster prediction of distribution network is the main one, and the prediction of its disaster degree often determines whether the distribution network can be prevented before and rescued after the disaster. Therefore, in view of the above problems, combined with the actual transmission situation of the distribution network, after collecting the measured disaster data of the distribution network in relevant areas, combined with the multi-source data fusion technology and neural network modeling technology, this paper analyzes the disaster degree indicators of different distribution networks and constructs the relevant fuzzy matrix through the fuzzy theory to evaluate the disaster degree, which is verified by the measured data. This distribution network disaster loss prediction model can effectively implement the disaster loss prediction of distribution network and compare its prediction results with the other two different common models. The comparison results show that the prediction accuracy of the multi-source data fusion prediction model constructed in this paper is more than 0.95 compared with the other two models, while the prediction accuracy of the other two models is not more than 0.9, which proves that the model constructed in this paper has smaller errors. It has the advantages of higher accuracy and faster convergence speed. [ABSTRACT FROM AUTHOR]

Lack of trust, lack of standards, and low efficiency are the three biggest problems in China's trade financing at present. With the development and application of new generation technologies such as big data, cloud computing, artificial intelligence, and blockchain technology, China is in the stage of financial technology 3.0 under the deep integration of finance and technology. In the field of financial technology, the most concerned is the application of blockchain technology in trade finance business. With the successive construction of various blockchain platforms and the acceleration of the internationalization process, the international trade credit risk behind it is also increasing. Among many financial services, trade finance is the most closely integrated field with blockchain technology. In this context, preventing the risks in the business process of international trade enterprises, so as to reduce the cost of financial transactions, improve the effectiveness of financial services, and better serve the real economy is not only the internal development needs of enterprises, but also the national financial strategy needs. In view of the above problems, this paper analyzes the risk factors faced by multinational trading enterprises in the transaction process through the transaction data of some multinational enterprises on mobile phones, and constructs a credit evaluation system of international trading enterprises based on blockchain, in order to enhance the trade risk resistance ability of international trading companies. [ABSTRACT FROM AUTHOR]

This paper proposes a multiview collaborative visual analysis system of network security based on a DPCA (clustering by fast search and find of density peaks) clustering algorithm called DPCANETVis, with network security analysis requirements for multisource heterogeneous data. Firstly, the system proposes an improved DPCA clustering algorithm based on the hierarchical relationship of mail sending and receiving to achieve the purpose of accurate classification. Secondly, a three-layer visual layout is designed to display relevant information such as data hierarchy, node relationship, behavior model, and other relevant information, by mixing a variety of interactive visual analysis methods such as tree diagram, word cloud, line diagram, subject river, and parallel coordinate. Lastly, based on the exploration of events, all suspicious nodes and their abnormal behaviors can be displayed in the system. Finally, the prototype system is used to analyze the network security log data set provided by the ChinaVis 2018, and the feasibility of the multilevel interactive visual analysis method for network security is verified through many experiments and discussions. [ABSTRACT FROM AUTHOR]

This research aims to improve the rationality and intelligence of AUTOMATICALLY HIGHER MATHEMATICALLY EXAM SYSTEM (AHMES) through some AI algorithms. AHMES is an intelligent and high-quality higher math examination solution for the Department of Computer Engineering at Pai Chai University. This research redesigned the difficulty system of AHMES and used some AI algorithms for initialization and continuous adjustment. This paper describes the multiple linear regression algorithm involved in this research and the AHMES learning (AL) algorithm improved by the Q-learning algorithm. The simulation test results of the upgraded AHMES show the effectiveness of these algorithms. [ABSTRACT FROM AUTHOR]

With the proliferation of portable digital products, image quality degradation has received a lot of attention. As the most common phenomenon in image degradation, the issue of image deblurring is the focus of much attention. Blind motion blur removal is the main target of this paper. The heavy-tailed distribution is the most dominant statistical feature of natural images. However, most image deblurring methods use a gradient prior with fixed parameters to recover a clear image, which leads to loss of details in the recovered clear image and does not consider the higher order prior of the natural image. Therefore, this paper proposes a new regularized image recovery model based on the Gaussian-scale mixture expert field(GSM-FOE) model. First, the GSM-FoE model learns filters and corresponding parameters with higher order prior information of images by training images in a natural image library; second, these learning results are used to guide the image recovery process. The GSM-FoE model and gradient-fidelity based image recovery model is proposed, which can be used with an iterative re-weighted least squares (IRLS) method. Experiments demonstrate that the suggested recovery approach is simple to use and successful at reducing blur and noise, as well as suppressing ringing effects while preserving image information. Moreover, the image restoration method performs well for large blurring kernels. The results fully reflect the effectiveness and robustness of the proposed method for complex noise scenarios. The quality of the generated images is significantly better than that of several classical methods. [ABSTRACT FROM AUTHOR]

In this paper, a data-driven differential dynamic programming (DDP) algorithm is presented for the optimal tracking problems of nonlinear affine systems with unknown drift dynamics. Optimal tracking dynamics are established between the system states and expected trajectory. By using the DDP method and test data, a second-order data-driven framework of the Hamilton–Jacobi–Bellman (HJB) equation is constructed, in which system approximation and value function approximation are used. By using this framework, a data-driven iteration algorithm is proposed to achieve the optimal tracking controller. A simulation example is provided to verify the effectiveness of the proposed approach. [ABSTRACT FROM AUTHOR]

In order to solve the limitations of the traditional method of determining expert weights in AHP and improve the level of the regional economy, this paper proposes a neural network algorithm based on AHP. This paper first calculates the interest correlation coefficient among experts, then obtains the comprehensive evaluation value of all experts according to the evaluation value matrix, and then determines the evaluation weight of each expert in the expert group. Finally, the comprehensive weight of each index is obtained by weighting the index weight obtained from the traditional AHP and the expert evaluation weight. Then, the evaluation value obtained by the improved AHP is used as a prior sample to train and test the BP neural network, and a classifier that can be popularized is obtained. The experimental results show that the overall evaluation value of circular economy of 9 construction enterprises is at a medium level, only 2 enterprises have an evaluation value of more than 50, and one enterprise has an evaluation value of only 35, indicating that the overall implementation of circular economy of these 9 construction enterprises is still at a low level, with great room for development and improvement. Conclusion. The economic management method based on a neural network algorithm can make the evaluation results more accurate and reliable and has high popularization and application value. [ABSTRACT FROM AUTHOR]