Search

At present, there are some problems in the process of human motion recognition, such as poor timeliness and low fault tolerance rate. How to effectively identify the motion process accurately has become a hot spot in the optimization system. In the existing research studies, the recognition accuracy is not very good and the response time is long. To end this issue, the paper proposed an information processing system and optimization method of human motion recognition based on the GA-BP neural network algorithm. Firstly, a human motion recognition system based on dynamic capture recognition technology is designed, which realizes the recognition of motion information from common postures such as action span, speed change, motion trajectory, and other aspects in the process of human motion. Secondly, the proposed algorithm is used to comprehensively analyse and evaluate the motion state. Finally, experiments are designed to verify and analyse the results. Compared to some baseline methods in human motion recognition information systems, the system in this paper based on the GA-BP neural network algorithm has the advantages of higher data accuracy and response speed, which can quickly and accurately identify the muscle group change in the process of human motion, and it can also provide customized motion suggestions based on the results. [ABSTRACT FROM AUTHOR]

Feature selection provides the optimal subset of features for data mining models. However, current feature selection methods for high-dimensional data also require a better balance between feature subset quality and computational cost. In this paper, an efficient hybrid feature selection method (HFIA) based on artificial immune algorithm optimization is proposed to solve the feature selection problem of high-dimensional data. The algorithm combines filter algorithms and improves clone selection algorithms to explore the feature space of high-dimensional data. According to the target requirements of feature selection, combined with biological research results, this method introduces the lethal mutation mechanism and the Cauchy operator to improve the search performance of the algorithm. Moreover, the adaptive adjustment factor is introduced in the mutation and update phases of the algorithm. The effective combination of these mechanisms enables the algorithm to obtain a better search ability and lower computational costs. Experimental comparisons with 19 state-of-the-art feature selection methods are conducted on 25 high-dimensional benchmark datasets. The results show that the feature reduction rate for all datasets is above 99%, and the performance improvement for the classifier is between 5% and 48.33%. Compared with the five classical filtering feature selection methods, the computational cost of HFIA is lower than the two of them, and it is far better than these five algorithms in terms of the feature reduction rate and classification accuracy improvement. Compared with the 14 hybrid feature selection methods reported in the latest literature, the average winning rates in terms of classification accuracy, feature reduction rate, and computational cost are 85.83%, 88.33%, and 96.67%, respectively. [ABSTRACT FROM AUTHOR]

Considering that in the process of job scheduling, the cluster load should be prebalanced rather than remedied when the load is seriously unbalanced; therefore, in this paper, the task scheduling flow of the Hadoop cluster is analyzed deeply. On the Hadoop platform, a self-dividing algorithm is proposed for load balancing. An intelligent optimization algorithm is used to solve load balance. A dynamic feedback load balancing scheduling method is proposed from the point of view of task scheduling. In order to solve the shortcoming of the fair scheduling algorithm, this paper proposes two ways to improve the resource utilization and overall performance of Hadoop. When the mapping task is completed and the tasks to be reduced are assigned, the task assignment is based on the performance of the nodes to be reduced. It gives full play to the advantages of the ant colony algorithm and the hive colony algorithm so that the fusion algorithm can better deal with load balance. Then, three existing scheduling algorithms are introduced in detail: single queue scheduling, capacity scheduling, and fair scheduling. On this basis, an improved task scheduling strategy based on genetic algorithm is proposed to allocate and execute application tasks to reduce task completion time. The experiment verifies the effectiveness of the algorithm. The LBNP algorithm greatly improves the efficiency of reducing task execution and job execution. The delay capacity scheduling algorithm can ensure that most tasks can achieve localization scheduling, improve resource utilization, improve load balance, and speed up job completion time. [ABSTRACT FROM AUTHOR]

In the financial industry, it is of great significance to study the multiobjective portfolio optimization for obtaining a reasonable investment strategy. This paper designs the financial portfolio scheme based on the multiobjective optimization algorithm that is based on the framework of the NSGA-II algorithm. In order to introduce convergence information, aiming at the actual problem of the portfolio, the mixed individual coding mechanism with asset information expands the application of the multiobjective evolutionary algorithm in portfolio optimization. The portfolio scheme obtained is effective, which is helpful to improve the decision-making efficiency of financial investors and enriches the application of modern financial theory. [ABSTRACT FROM AUTHOR]

Strong ground clutter echoes make it difficult to detect low-altitude slow-speed small (LSS) targets. To suppress ground clutter effectively in LSS target detection, a robust transmit beamforming algorithm has been proposed in this paper. Sidelobes in the ground side can be cut down, with the excess energy concentrated on the air side, which would be cleaner and simpler. The objective function is a second-order cone programming problem and can be solved by the convex optimization algorithm. With the consideration of taking full advantage of transmit power, the weight vector is further processed under the unimodular constraint. Numerical experiments are carried out to demonstrate the validity and superiority of the proposed method. [ABSTRACT FROM AUTHOR]

It is well known that we, as human beings, are prone to a variety of undesirable emotions such as excitement, boredom, and fear, all of which are induced by varying degrees of negative states. In this paper, we designed an emotion-evoking experiment to induce calm, excited, bored, and fearful emotions, as well as low, moderate, and high levels of tension. Based on the six physiological signals such as heart rate and respiration rate of the subjects in these emotion states, feature extraction was performed after removing the baseline preprocessing, combined with particle swarm optimisation algorithm for feature selection, and the k-nearest neighbour algorithm was used to classify the different emotion and tension levels in the undesirable states. By comparing the results of several sets of experiments, we found that with baseline removal and particle swarm feature selection optimisation, our experimental results using k-nearest neighbour classification showed a significant improvement in recognition accuracy compared to the traditional k-nearest neighbour algorithm, which indicates that the proposed method has better recognition results. [ABSTRACT FROM AUTHOR]

Most of the traditional tourism route planning algorithms only consider single-factor planning, that is, the influence of scenic spots on route planning. Particle swarm optimization algorithm is favored by many people because of its simple concept, easy implementation, and good robustness. Aiming at this problem, this paper takes the actual geographic data as the research object of the tourism route problem and describes the model of the discrete particle swarm algorithm based on geographic coordinates to solve the tourism route problem, which is used to solve practical problems. In order to further improve the global search ability of the algorithm, a self-balancing mechanism is proposed, which makes the algorithm process simple and the algorithm performance improved. At the same time, multithread parallelism is adopted to improve the solution speed of the algorithm, which makes up for the deficiency of the parallelization research of the algorithm. [ABSTRACT FROM AUTHOR]

This paper solves the shortcomings of sparrow search algorithm in poor utilization to the current individual and lack of effective search, improves its search performance, achieves good results on 23 basic benchmark functions and CEC 2017, and effectively improves the problem that the algorithm falls into local optimal solution and has low search accuracy. This paper proposes an improved sparrow search algorithm based on iterative local search (ISSA). In the global search phase of the followers, the variable helix factor is introduced, which makes full use of the individual's opposite solution about the origin, reduces the number of individuals beyond the boundary, and ensures the algorithm has a detailed and flexible search ability. In the local search phase of the followers, an improved iterative local search strategy is adopted to increase the search accuracy and prevent the omission of the optimal solution. By adding the dimension by dimension lens learning strategy to scouters, the search range is more flexible and helps jump out of the local optimal solution by changing the focusing ability of the lens and the dynamic boundary of each dimension. Finally, the boundary control is improved to effectively utilize the individuals beyond the boundary while retaining the randomness of the individuals. The ISSA is compared with PSO, SCA, GWO, WOA, MWOA, SSA, BSSA, CSSA, and LSSA on 23 basic functions to verify the optimization performance of the algorithm. In addition, in order to further verify the optimization performance of the algorithm when the optimal solution is not 0, the above algorithms are compared in CEC 2017 test function. The simulation results show that the ISSA has good universality. Finally, this paper applies ISSA to PID parameter tuning and robot path planning, and the results show that the algorithm has good practicability and effect. [ABSTRACT FROM AUTHOR]

Aiming at the problems existing in the traditional teaching mode, this paper intelligently optimizes English teaching courses by using multidirectional mutation genetic algorithm and its optimization neural network method. Firstly, this paper gives the framework of intelligent English course optimization system based on multidirectional mutation genetic BP neural network and analyses the local optimization problems existing in the traditional BP algorithm. A BP neural network optimization algorithm based on multidirectional mutation genetic algorithm (MMGA-BP) is presented. Then, the multidirectional mutation genetic BPNN algorithm is applied to the intelligent optimization of English teaching courses. The simulation shows that the multidirectional mutation genetic BP neural network algorithm can solve the local optimization problem of traditional BP neural network. Finally, a control group and an experimental group are set up to verify the role of multidirectional mutation genetic algorithm and its optimization neural network in the intelligent optimization system of English teaching courses through the combination of summative and formative teaching evaluations. The data show that MMGA-BP algorithm can significantly improve the scores of academic students in English courses and has better teaching performance. The effect of vocabulary teaching under the guidance of MMGA-BP optimization theory is very significant, which plays a certain role in the intelligent curriculum optimization of the experimental class. [ABSTRACT FROM AUTHOR]

The deep Q-network (DQN) is one of the most successful reinforcement learning algorithms, but it has some drawbacks such as slow convergence and instability. In contrast, the traditional reinforcement learning algorithms with linear function approximation usually have faster convergence and better stability, although they easily suffer from the curse of dimensionality. In recent years, many improvements to DQN have been made, but they seldom make use of the advantage of traditional algorithms to improve DQN. In this paper, we propose a novel Q-learning algorithm with linear function approximation, called the minibatch recursive least squares Q-learning (MRLS-Q). Different from the traditional Q-learning algorithm with linear function approximation, the learning mechanism and model structure of MRLS-Q are more similar to those of DQNs with only one input layer and one linear output layer. It uses the experience replay and the minibatch training mode and uses the agent's states rather than the agent's state-action pairs as the inputs. As a result, it can be used alone for low-dimensional problems and can be seamlessly integrated into DQN as the last layer for high-dimensional problems as well. In addition, MRLS-Q uses our proposed average RLS optimization technique, so that it can achieve better convergence performance whether it is used alone or integrated with DQN. At the end of this paper, we demonstrate the effectiveness of MRLS-Q on the CartPole problem and four Atari games and investigate the influences of its hyperparameters experimentally. [ABSTRACT FROM AUTHOR]

Based on Salp Swarm Algorithm (SSA) and Slime Mould Algorithm (SMA), a novel hybrid optimization algorithm, named Hybrid Slime Mould Salp Swarm Algorithm (HSMSSA), is proposed to solve constrained engineering problems. SSA can obtain good results in solving some optimization problems. However, it is easy to suffer from local minima and lower density of population. SMA specializes in global exploration and good robustness, but its convergence rate is too slow to find satisfactory solutions efficiently. Thus, in this paper, considering the characteristics and advantages of both the above optimization algorithms, SMA is integrated into the leader position updating equations of SSA, which can share helpful information so that the proposed algorithm can utilize these two algorithms' advantages to enhance global optimization performance. Furthermore, Levy flight is utilized to enhance the exploration ability. It is worth noting that a novel strategy called mutation opposition-based learning is proposed to enhance the performance of the hybrid optimization algorithm on premature convergence avoidance, balance between exploration and exploitation phases, and finding satisfactory global optimum. To evaluate the efficiency of the proposed algorithm, HSMSSA is applied to 23 different benchmark functions of the unimodal and multimodal types. Additionally, five classical constrained engineering problems are utilized to evaluate the proposed technique's practicable abilities. The simulation results show that the HSMSSA method is more competitive and presents more engineering effectiveness for real-world constrained problems than SMA, SSA, and other comparative algorithms. In the end, we also provide some potential areas for future studies such as feature selection and multilevel threshold image segmentation. [ABSTRACT FROM AUTHOR]

The new coronavirus, COVID-19, has affected people all over the world. Coronaviruses are a large group of viruses that can infect animals and humans and cause respiratory distress; these discomforts may be as mild as a cold or as severe as pneumonia. Correct detection of this disease can help to avoid its spreading increasingly. In this paper, a new CAD-based approach is suggested for the optimal diagnosis of this disease from chest X-ray images. The proposed method starts with a min-max normalization to scale all data into a normal scale, and then, histogram equalization is performed to improve the quality of the image before main processing. Afterward, 18 different features are extracted from the image. To decrease the method difficulty, the minimum features are selected based on a metaheuristic called Archimedes optimization algorithm (AOA). The model is then implemented on three datasets, and its results are compared with four other state-of-the-art methods. The final results indicated that the proposed method with 86% accuracy and 96% precision has the highest balance between accuracy and reliability with the compared methods as a diagnostic system for COVID-19. [ABSTRACT FROM AUTHOR]

Edge services are transferred data processing, application running, and implementation of some functional services from cloud central server to network edge server to provide services. Combined edge service can effectively reduce task computation in the cloud, shorten transmission distance of processing data, quickly decompose task of service request, and select the optimal edge service combination to provide service for users. BAS is an efficient intelligent optimization algorithm, which can achieve efficient optimization and neither need to know the specific form of function nor need gradient information. This paper designs an edge service composition model based on edge computing and proposes a method about edge service composition by BAS optimization algorithm. Our proposed method has obvious advantages in service composition efficiency compared with service composition method based on PSO or WPA heuristic algorithm. Compared with cloud service composition method, our proposed method has advantages of shorter service response time, low cost, and high quality of user experience. [ABSTRACT FROM AUTHOR]

To improve enterprise financial early warning, we propose an algorithm based on a decision tree. According to the shortcomings and defects of the classical algorithm and the traditional decision tree algorithm, in the ordinary decision tree improved algorithm based on PCA, there is a problem that the representativeness of the data after dimensionality reduction processing are not high, resulting in the fact that the accuracy of the algorithm can be improved slightly after multiple data runs. Based on the classical algorithm, attribute eigenvalues before classification are extracted twice, and the amount of data to be classified is calculated. That is, the most important attributes of the original data are selected. After the subtree is established, the dimension reduction and merging selection of the data are performed, and the improved algorithm is verified by using three data sets in the UCI database. The results show that the average accuracy in the three datasets is 94.6%, which is improved by 1.6% and 0.6% for the traditional classical algorithm and the ordinary PCA decision tree optimization algorithm, respectively. PCA-based decision tree algorithms can improve the accuracy of the results to some extent, which is of practical importance. In the future, a classic algorithm improved for secondary modeling will be used to obtain a more efficient decision tree model. The decision tree algorithm has been proven to recognize an early warning of an enterprise's financial risks, which enhances the effectiveness of an enterprise's early financial warning. [ABSTRACT FROM AUTHOR]

Slime mould algorithm (SMA) is a population-based metaheuristic algorithm inspired by the phenomenon of slime mould oscillation. The SMA is competitive compared to other algorithms but still suffers from the disadvantages of unbalanced exploitation and exploration and is easy to fall into local optima. To address these shortcomings, an improved variant of SMA named MSMA is proposed in this paper. Firstly, a chaotic opposition-based learning strategy is used to enhance population diversity. Secondly, two adaptive parameter control strategies are proposed to balance exploitation and exploration. Finally, a spiral search strategy is used to help SMA get rid of local optimum. The superiority of MSMA is verified in 13 multidimensional test functions and 10 fixed-dimensional test functions. In addition, two engineering optimization problems are used to verify the potential of MSMA to solve real-world optimization problems. The simulation results show that the proposed MSMA outperforms other comparative algorithms in terms of convergence accuracy, convergence speed, and stability. [ABSTRACT FROM AUTHOR]

Financial early warning mechanism is of great significance to the long-term healthy development and stable operation of listed enterprises. This paper adopts the logistic regression early warning model and BP neural network early warning model. Based on the BP neural network t early warning model optimized by the simulated annealing algorithm, the prediction effects of the model are compared from the perspectives of model accuracy and variable importance. Through the comparative analysis of the empirical results of the three methods, it can be seen that the simulated annealing algorithm has many advantages. The combination of the simulated annealing algorithm with multithreading, data compression, and segmentation greatly improves the efficiency of the algorithm and shortens the running time. Using the logistic regression early warning model and BP neural network early warning model and based on the BP neural network t early warning model optimized by the simulated annealing algorithm, the prediction effects of the model are compared from the perspective of model accuracy and variable importance. The results show that the three index dimensions of the BP neural network optimized by the simulated annealing algorithm have good discrimination ability to financial status. The BP neural network early warning model optimized based on the simulated annealing algorithm has good prediction accuracy and good practical significance. [ABSTRACT FROM AUTHOR]

Aiming to solve the problems of low fault tolerance, low throughput, and high delay in traditional methods, an improved method of the blockchain cross-chain consensus algorithm based on weighted PBFT is proposed. This article constructs a blockchain cross-chain exchange model based on cluster centers and divides the nodes in the blockchain system into consensus service nodes, cross-chain exchange nodes, and application nodes to improve the performance of consensus computing services. On this basis, according to the weighted PBFT consensus mechanism, the blockchain consensus environment is set up, and the distribution of nodes in the consensus domain and the blockchain signature scheme are obtained. Therefore, the blockchain cross-chain consensus optimization algorithm is designed to reduce throughput and delay and optimize the consensus effect. The experimental results show that the proposed method can effectively improve the shortcomings of traditional methods, with high throughput and low latency, and strong security. It shows that it is a low resource consumption and secure consensus method. [ABSTRACT FROM AUTHOR]

The potential to obtain defective or damaged items with non-defective commodities is common to experience at the production unit or when shipping products from one layer to another. This research focuses on the faulty things that retailers receive from suppliers. The retailer has set a restriction on the percentage of defective things, and the retailer receives a discount on the cost of purchasing defective items. The proposed inventory system handles the uncertainty in inventory costs and also considers the demand and deterioration of items with prioritized maximum product life. This work minimizes total inventory cost when demand rate as a function of reliability and power pattern of time under a crisp and triangular neutrosophic environment. The inventory system for degrading items considers the predictability and power pattern of time with a reasonable payment delay. The interest charges are applied only after a specific permissible time limit in the proposed inventory system. The neutrosophic number that defines three different kinds of membership functions representing the truth, hesitation, and falseness is applied in the inventory model in handling the uncertainty of the cost pattern. The proposed inventory model is investigated using a particle swarm optimization algorithm, and the results are validated using a numerical example and a sensitivity analysis for various parameters. [ABSTRACT FROM AUTHOR]

Shuffled frog leaping algorithm, a novel heuristic method, is inspired by the foraging behavior of the frog population, which has been designed by the shuffled process and the PSO framework. To increase the convergence speed and effectiveness, the currently improved versions are focused on the local search ability in PSO framework, which limited the development of SFLA. Therefore, we first propose a new scheme based on evolutionary strategy, which is accomplished by quantum evolution and eigenvector evolution. In this scheme, the frog leaping rule based on quantum evolution is achieved by two potential wells with the historical information for the local search, and eigenvector evolution is achieved by the eigenvector evolutionary operator for the global search. To test the performance of the proposed approach, the basic benchmark suites, CEC2013 and CEC2014, and a parameter optimization problem of SVM are used to compare 15 well-known algorithms. Experimental results demonstrate that the performance of the proposed algorithm is better than that of the other heuristic algorithms. [ABSTRACT FROM AUTHOR]