Evaluation Algorithm of Skilled Talents’ Quality Based on Deep Belief Network Model

In order to solve the problem that the evaluation algorithm is easy to fall into local extremum, which leads to slow convergence speed, a skilled talent quality evaluation algorithm based on a deep belief network model was designed. Establish an evaluation set with 4 first level indicators and 14 second level indicators, and calculate the corresponding weights to complete the construction of the evaluation index system. A DBN structure composed of several RBMs and a BP network is constructed. Based on the DBN, a quality evaluation algorithm is designed. The algorithm training is used to evaluate the test data and output the evaluation level. The experimental results show that the convergence speed of DBN based evaluation algorithm is significantly better than that of BP neural network and SVM based evaluation algorithm under the same number of iterations, which is suitable for the accurate evaluation of talent quality.

Prediction of Evolution and Development Trend in Sports Industry Cluster Based on Particle Swarm Optimization

Sports industry cluster refers to the economic phenomenon that sports related enterprises gather in a large number in a specific area. For the sports enterprises in the cluster, they can obtain huge competitive advantages through enterprise agglomeration, thus obtaining better development and rich economic benefits. The optimization of particle swarm optimization is interlinked with the agglomeration of industrial clusters. Therefore, in view of the limitation of the standard particle swarm optimization (PSO) algorithm, an improved particle swarm optimization algorithm-diaphragm particle swarm optimization (D-PSO) was proposed and used to simulate the formation of sports industry clusters. D-PSO introduces the cell membrane processing mechanism of the biological system into the PSO algorithm, which improves the ability of the PSO algorithm to get rid of local extremum points. The competitiveness value of the sports industry cluster is the value of the objective function solved by the D-PSO algorithm. The geographical coordinates of the industrial cluster were the locations in the particle search space of the D-PSO algorithm. The D-PSO algorithm is used to simulate the aggregation process of enterprises in the cluster. Compared with the standard PSO, the D-PSO algorithm has better convergence performance and optimal rate. The results of case analysis show that the proposed method can effectively predict the development trend of sports industrial clusters.

Financial Performance Management System and Wireless Sharing Network Optimization of Listed Enterprises under BPNN

The study aims to respond to the difficulties in establishing an index system in financial performance management and ensuring the security of wireless sharing network and the local extremum and slow convergence speed of the traditional BP neural network (BPNN). First, Levenberg–Marquardt (LM) is used to optimize BPNN, and an improved BPNN is proposed. Second, the financial performance evaluation system of listed companies based on BPNN is constructed. Finally, a wireless network infusion detection system based on the improved BPNN is proposed and tested by constructing datasets and a real test environment. The results show that (1) the financial performance evaluation system of listed enterprises constructed can evaluate the financial performance of listed enterprises with fewer errors. It is easy to operate, and it has high accuracy and the abilities of self-learning and self-adaptation; (2) Wireless Infusion Detection System (WIDS) based on the improved BP algorithm has a high detection rate and a low error rate. The study provides important technical support for listed enterprises to improve the financial performance management level and market competitiveness and strengthen the security protection of networks.

On a Parallelised Diffusion Induced Stochastic Algorithm with Pure Random Search Steps for Global Optimisation

We propose a stochastic algorithm for global optimisation of a regular function, possibly unbounded, defined on a bounded set with regular boundary; a function that attains its extremum in the boundary of its domain of definition. The algorithm is determined by a diffusion process that is associated with the function by means of a strictly elliptic operator that ensures an adequate maximum principle. In order to preclude the algorithm to be trapped in a local extremum, we add a pure random search step to the algorithm. We show that an adequate procedure of parallelisation of the algorithm can increase the rate of convergence, thus superseding the main drawback of the addition of the pure random search step.

Topological optimisation technology of gravity dam section structure based on ANSYS partial differential equation operation

This paper uses the finite element method to explain the specific nature of numerical instability such as network dependence in the topology optimisation of engineering structures from the perspective of partial differential equations. Gaussian function filtering method reduces the global impact of local extremum on topology optimisation. Finally, the method is introduced into the topology optimisation of concrete gravity dams in hydraulic engineering, and the topology optimisation program is developed in conjunction with ANSYS software language to achieve the topology optimisation of building structures in hydraulic engineering from a technical perspective.

Bacterial Foraging Algorithm With Potential Field Guidance Mechanism

To address the problems of weak quorum sensing ability and slow convergence speed in bacterial foraging algorithm, a bacterial foraging algorithm with potential field guidance mechanism is proposed. The algorithm combines the sampling guidance mechanism in the artificial potential field algorithm to provide the optimization direction for each bacterium; The original swimming operation of bacterial foraging algorithm is used to realize the local optimization strategy, and the local dimension update is added after swimming, so that the search range of bacteria in chemotaxis operation is wider; In the elimination and dispersal operation of bacterial foraging algorithm, double Gaussian function is introduced to re initialize the location of bacteria, so as to better avoid the algorithm falling into local extremum and improve the optimization ability of the algorithm. The experimental results show that the improved bacterial foraging algorithm has better optimization ability than the basic bacterial foraging algorithm.

Optimization of CSO algorithm based on adaptive inertia weight coefficient

The traditional CSO algorithm is easy to fall into local extremum in optimization. In this paper, a CSO algorithm based on weight coefficient is proposed. In the CSO algorithm, the inertia weight coefficient is introduced into the hen position formula, and the learning factor influenced by the rooster is added to the chick position formula. Finally, using the idea of heredity, individuals with excellent fitness value are selected for crossover and mutation with a certain probability. Through the simulation comparison of five typical test functions, the simulation results show that the improved CSO algorithm can avoid local optimization, strengthen the global extreme value search ability, and improve the convergence speed and accuracy range of the algorithm.

Inversion Analysis of Seepage Parameters Based on Improved Shuffled Frog Leaping Algorithm

Aiming at overcoming the defects such as slow searching speed and easily trapping into local extremum at anaphase of the shuffled frog leaping algorithm (SFLA), based on the Evolutionary Exploration strategy, a more effective shuffled frog leaping algorithm, Improved Shuffled Frog Leaping Algorithm (ISFLA), which can be applied to the inverse analysis of seepage parameters to dams, is proposed. With the introduction of the threshold value selection in the local search of the original initial population to improve the best frogs in memeplex, the improved algorithm overcomes the shortcomings of traditional SFLA which can easily fall into a local optimum. By comparative analysis between the laboratory test and numerical simulation, the effectiveness and accuracy of ISFLA are demonstrated by the application to the inversion analysis of seepage parameters of earth dams. Furthermore, the inversion analysis of seepage parameters to the earth dam in Lianyungang China is studied by the ISFLA. Moreover, the seepage characteristics of the dam are evaluated; thus, the suggestion that the dam should be reinforced is put forward. All the results show that ISFLA in an inverse analysis of seepage parameters of dams has excellent value to hydropower engineering.

A Hybrid Max–Min Ant System by Levy Flight and Opposition-Based Learning

The max–min ant system (MMAS) is a modified ant colony optimization (ACO) algorithm. Its convergence speed is effectively improved by setting the upper and lower bounds of the pheromone and updating it in the optimal path. However, MMAS still has drawbacks, such as long search time and local extremums. In this paper, the hybrid max–min ant system (HMMAS) is proposed to deal with the shortcomings of MMAS. Employing Levy flight strategy, HMMAS can dynamically adjust the parameters to increase the diversity of solutions and expand the search range. Besides, HMMAS uses the OBL strategy to generate opposite solutions in the early stage. In this way, the convergence is accelerated. When HMMAS falls into a local extremum, the path reorganization strategy is utilized. With its help, HMMAS can redistribute the pheromone in each path and achieve global optimum. To verify the effectiveness, HMMAS is first compared with the three conventional ACO algorithms of AS, ACS, and MMAS in 20 sets of experiments. The results indicate that the average results of HMMAS in the 19 sets of TSP instances are better than the other three algorithms, and the standard deviation in the 14 sets of calculation instances is the smallest. Then, HMMAS is compared with some state-of-the-art algorithms, and the results show that HMMAS is better than other comparison algorithms, either by the minimum or the average value.

Characteristics of Impulse Carburization LPC Process

In the present work, Pyrowear53 steel was subjected to the impulse carburizing LPC process. After carburation, the material was quenched and tempered. Postprocessing analyses included the measurement of hardness, carbon content, residual austenite, and residual stresses. The results revealed that the thermochemical treatment resulted in the formation of an approximately 1200 µm wide carburized layer. The results of hardness, carbon content, and residual austenite measurement showed a continuous gradient (drop) in the measured values within the carburized layer. However, the results of residual stresses revealed the existence of a local extremum, namely, a zone with higher compressive stresses at the depth between 600 and 1000 µm. This was explained by a different temperature for initiation of martensite transformation as a function of carbon content. This difference resulted in the occurrence of two martensite expansion fronts at two different depths, resulting in an increase in compressive stresses at the noted depth range. Moreover, it was concluded that this region was present for material containing between 0.8 and 0.4 wt% carbon for Pyrowear53.