Search

In this paper, a robust observer-based sliding mode control algorithm is proposed to address the modelling and measurement inaccuracies, load variations, and external disturbances of flexible articulated manipulators. Firstly, a sliding mode observer was designed with exponential convergence to observe system state accurately and to overcome the measuring difficulty of the state variables, unmeasurable quantities, and external disturbances. Next, a robust sliding mode controller was developed based on the observer, such that the output error of the system converges to zero in finite time. In this way, the whole system achieves asymptotic stability. Finally, the convergence conditions of the observer were theoretically analyzed to verify the convergence of the proposed algorithm, and simulation was carried out to confirm the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

In this paper, we give a modified gradient EM algorithm; it can protect the privacy of sensitive data by adding discrete Gaussian mechanism noise. Specifically, it makes the high-dimensional data easier to process mainly by scaling, truncating, noise multiplication, and smoothing steps on the data. Since the variance of discrete Gaussian is smaller than that of the continuous Gaussian, the difference privacy of data can be guaranteed more effectively by adding the noise of the discrete Gaussian mechanism. Finally, the standard gradient EM algorithm, clipped algorithm, and our algorithm (DG-EM) are compared with the GMM model. The experiments show that our algorithm can effectively protect high-dimensional sensitive data. [ABSTRACT FROM AUTHOR]

In order to improve software quality and testing efficiency, this paper implements the prediction of software defects based on deep learning. According to the respective advantages and disadvantages of the particle swarm algorithm and the wolf swarm algorithm, the two algorithms are mixed to realize the complementary advantages of the algorithms. At the same time, the hybrid algorithm is used in the search of model hyperparameter optimization, the loss function of the model is used as the fitness function, and the collaborative search ability of the swarm intelligence population is used to find the global optimal solution in multiple local solution spaces. Through the analysis of the experimental results of six data sets, compared with the traditional hyperparameter optimization method and a single swarm intelligence algorithm, the model using the hybrid algorithm has higher and better indicators. And, under the processing of the autoencoder, the performance of the model has been further improved. [ABSTRACT FROM AUTHOR]

Feature selection is the key step in the analysis of high-dimensional small sample data. The core of feature selection is to analyse and quantify the correlation between features and class labels and the redundancy between features. However, most of the existing feature selection algorithms only consider the classification contribution of individual features and ignore the influence of interfeature redundancy and correlation. Therefore, this paper proposes a feature selection algorithm for nonlinear dynamic conditional relevance (NDCRFS) through the study and analysis of the existing feature selection algorithm ideas and method. Firstly, redundancy and relevance between features and between features and class labels are discriminated by mutual information, conditional mutual information, and interactive mutual information. Secondly, the selected features and candidate features are dynamically weighted utilizing information gain factors. Finally, to evaluate the performance of this feature selection algorithm, NDCRFS was validated against 6 other feature selection algorithms on three classifiers, using 12 different data sets, for variability and classification metrics between the different algorithms. The experimental results show that the NDCRFS method can improve the quality of the feature subsets and obtain better classification results. [ABSTRACT FROM AUTHOR]

Federated learning (FL) is an emerging subdomain of machine learning (ML) in a distributed and heterogeneous setup. It provides efficient training architecture, sufficient data, and privacy-preserving communication for boosting the performance and feasibility of ML algorithms. In this environment, the resultant global model produced by averaging various trained client models is vital. During each round of FL, model parameters are transferred from each client device to the server while the server waits for all models before it can average them. In a realistic scenario, waiting for all clients to communicate their model parameters, where client models are trained on low-power Internet of Things (IoT) devices, can result in a deadlock. In this paper, a novel temporal model averaging algorithm is proposed for asynchronous federated learning (AFL). Our approach uses a dynamic expectation function that computes the number of client models expected in each round and a weighted averaging algorithm for continuous modification of the global model. This ensures that the federated architecture is not stuck in a deadlock all the while increasing the throughput of the server and clients. To implicate the importance of asynchronicity in cybersecurity, the proposed algorithm is tested using NSL-KDD intrusion detection system datasets. The performance accuracy of the global model is about 99.5% on the dataset, outperforming traditional FL models in anomaly detection. In terms of asynchronicity, we get an increased throughput of almost 10.17% for every 30 timesteps. [ABSTRACT FROM AUTHOR]

With the development of neural network technology and the rapid growth of China's tourism economic income at this stage, the research on the comprehensive evaluation of tourism resources has gradually emerged. Based on this, this paper studies the neural network comprehensive evaluation model based on multispecies evolutionary genetic algorithm and designs the neural network analysis system of influencing factors of tourism resources based on multispecies evolutionary genetic algorithm. The collection and acquisition of data information are realized from the aspects of resource income status, tourism development investment, and sustainability evaluation in the tourism area. The multispecies evolutionary genetic algorithm is used for comprehensive analysis and evaluation. The algorithm can realize the complex analysis and comprehensive evaluation of the core influencing factors of neural network. Accurate analysis and evaluation were carried out according to the different characteristics of tourism resources and the current situation of tourism income. The results show that the neural network comprehensive evaluation model based on multispecies evolutionary genetic algorithm has the advantages of high practicability, good sorting effect of variable ratio, and good data integration. It can effectively analyze and compare the comprehensive evaluation factors affecting tourism resources in different ratios. [ABSTRACT FROM AUTHOR]

Fetal movement is an important clinical indicator to assess fetus growth and development status in the uterus. In recent years, a noninvasive intelligent sensing fetal movement detection system that can monitor high-risk pregnancies at home has received a lot of attention in the field of wearable health monitoring. However, recovering fetal movement signals from a continuous low-amplitude background that is heavily contaminated with noise and recognizing real fetal movements is a challenging task. In this paper, fetal movement can be efficiently recognized by combining the strength of Kalman filtering, time and frequency domain and wavelet domain feature extraction, and hyperparameter tuned Light Gradient Boosting Machine (LightGBM) model. Firstly, the Kalman filtering (KF) algorithm is used to recover the fetal movement signal in a continuous low-amplitude background contaminated by noise. Secondly, the time domain, frequency domain, and wavelet domain (TFWD) features of the preprocessed fetal movement signal are extracted. Finally, the Bayesian Optimization algorithm (BOA) is used to optimize the LightGBM model to obtain the optimal hyperparameters. Through this, the accurate prediction and recognition of fetal movement are successfully achieved. In the performance analysis of the Zenodo fetal movement dataset, the proposed KF + TFWD + BOA-LGBM approach's recognition accuracy and F1-Score reached 94.06% and 96.85%, respectively. Compared with 8 existing advanced methods for fetal movement signal recognition, the proposed method has better accuracy and robustness, indicating its potential medical application in wearable smart sensing systems for fetal prenatal health monitoring. [ABSTRACT FROM AUTHOR]

Clustering of tumor samples can help identify cancer types and discover new cancer subtypes, which is essential for effective cancer treatment. Although many traditional clustering methods have been proposed for tumor sample clustering, advanced algorithms with better performance are still needed. Low-rank subspace clustering is a popular algorithm in recent years. In this paper, we propose a novel one-step robust low-rank subspace segmentation method (ORLRS) for clustering the tumor sample. For a gene expression data set, we seek its lowest rank representation matrix and the noise matrix. By imposing the discrete constraint on the low-rank matrix, without performing spectral clustering, ORLRS learns the cluster indicators of subspaces directly, i.e., performing the clustering task in one step. To improve the robustness of the method, capped norm is adopted to remove the extreme data outliers in the noise matrix. Furthermore, we conduct an efficient solution to solve the problem of ORLRS. Experiments on several tumor gene expression data demonstrate the effectiveness of ORLRS. [ABSTRACT FROM AUTHOR]

In recent years, with the gradual development of sports, the competition between athletes is becoming more and more fierce. The long training time and heavy body load of athletes lead to the increase of the incidence of sports injury, and the evaluation and analysis of athletes' sports injury need a lot of manpower and material resources. In order to improve the calculation efficiency of sports injury estimation results and save the cost of estimation and analysis, we propose a sports injury estimation model based on the algorithm model of mutation fuzzy neural network. The sports injury model constructed in this paper can not only systematically evaluate and analyze the degree of sports injury of athletes, but also improve the accuracy and efficiency; at the same time, it has universality for the evaluation and analysis of the degree of sports injury. The construction of this model provides the theoretical basis of big data algorithm for the prevention of sports injury and the application of mutation fuzzy neural network in the field of sports. [ABSTRACT FROM AUTHOR]

This paper proposes a mixed decision strategy for freight and passenger transportation in metro systems during off-peak hours (MTS-OPH). The definition of the mixed decision strategy is proposed, and fixed and flexible loading modes are considered for different passenger flow volumes. A mathematical model of the MTS-OPH is proposed and solved using an improved variable neighborhood search algorithm. Case studies demonstrate the performance and applicability of the proposed model and algorithm, and the MTS-OPH is discussed for different delivery distances, passenger flows, and metro network types. The proposed strategy is suitable for long-distance delivery, and the proposed model framework can be applied to different types of metro networks with different levels of complexity. The mixed decision strategy provides a decision support tool for metro and freight companies and can propose corresponding solutions according to different passenger flows. [ABSTRACT FROM AUTHOR]

In recent years, disasters have seriously affected the normal development of financial business in some regions. At the time of disaster, how to effectively integrate resources of all parties, deal with sudden financial disasters efficiently, and restore financial services in time has become an important task. Therefore, this paper adopts Particle Swarm Optimization (PSO) to improve the traditional BP Neural Network (BPNN) and finally constructs a Particle Swarm Optimization powered BP Neural Network (PSO-BPNN) model for the intelligent emergency risk avoidance of sudden financial disasters in digital economy. At the same time, the proposed algorithm is also compared to GA-BPNN and BPNN algorithms, which are also intelligent algorithms. Experimental results show that the hybrid PSO-BPNN algorithm is superior to GA-BPNN algorithm and BPNN algorithm in simulation and prediction effect. It can accurately predict the sudden financial disaster in recent period, so the model has a good application prospect. [ABSTRACT FROM AUTHOR]

This paper describes the construction of an electronic system that can recognise twelve manual motions made by an interlocutor with one of their hands in a situation with regulated lighting and background in real time. Hand rotations, translations, and scale changes in the camera plane are all supported by the implemented system. The system requires an Analog Devices ADSP BF-533 Ez-Kit Lite evaluation card. As a last stage in the development process, displaying a letter associated with a recognized gesture is advised. However, a visual representation of the suggested algorithm may be found in the visual toolbox of a personal computer. Individuals who are deaf or hard of hearing will communicate with the general population thanks to new technology that connects them to computers. This technology is being used to create new applications. [ABSTRACT FROM AUTHOR]

Increased frequency of disasters keeps reminding us of the importance of effective resource distribution in postdisaster. To reduce the suffering of victims, this paper focuses on how to establish an effective emergency logistics system. We first propose a multiobjective optimization model in which the location and allocation decisions are made for a three-level logistics network. Three objectives, deprivation costs, unsatisfied demand costs, and logistics cost, are adopted in the proposed optimization model. Several cardinality and flow balance constraints are considered simultaneously. Then, we design a novel effective IFA-GA algorithm by combining the firefly algorithm and genetic algorithm to solve this complex model effectively. Furthermore, three schemes are proposed to improve the effectiveness of the IFA-GA algorithm. Finally, the numerical results provide several insights on the theory and practice of relief distribution, which also illustrate the validity of the proposed solution algorithm. [ABSTRACT FROM AUTHOR]

The critical node detection problem (CNDP) refers to the identification of one or more nodes that have a significant impact on the entire complex network according to the importance of each node in a complex network. Most methods consider the CNDP as a single-objective optimization problem, which requires more prior knowledge to a certain extent. This paper proposes a membrane evolution algorithm MEA-CNDP to solve biobjective CNDP. MEA-CNDP includes a population initialization strategy based on the evaluation of decision variables, a strategy to transform the main objective, a strategy to update the membrane inherited pool, and four membrane evolutionary operators. The numerical experiments on 16 benchmark problems with random and logarithmic weights show that MEA-CNDP outperforms other algorithms in most cases. In particular, MEA-CNDP has unique advantages in dealing with large-scale sparse bi-CNDP. [ABSTRACT FROM AUTHOR]

As a new brain-inspired computational model of artificial neural networks, spiking neural networks transmit and process information via precisely timed spike trains. Constructing efficient learning methods is a significant research field in spiking neural networks. In this paper, we present a supervised learning algorithm for multilayer feedforward spiking neural networks; all neurons can fire multiple spikes in all layers. The feedforward network consists of spiking neurons governed by biologically plausible long-term memory spike response model, in which the effect of earlier spikes on the refractoriness is not neglected to incorporate adaptation effects. The gradient descent method is employed to derive synaptic weight updating rule for learning spike trains. The proposed algorithm is tested and verified on spatiotemporal pattern learning problems, including a set of spike train learning tasks and nonlinear pattern classification problems on four UCI datasets. Simulation results indicate that the proposed algorithm can improve learning accuracy in comparison with other supervised learning algorithms. [ABSTRACT FROM AUTHOR]

The development of artificial intelligence and worldwide epidemic events has promoted the implementation of smart healthcare while bringing issues of data privacy, malicious attack, and service quality. The Medical Internet of Things (MIoT), along with the technologies of federated learning and blockchain, has become a feasible solution for these issues. In this paper, we present a blockchain-based federated learning method for smart healthcare in which the edge nodes maintain the blockchain to resist a single point of failure and MIoT devices implement the federated learning to make full of the distributed clinical data. In particular, we design an adaptive differential privacy algorithm to protect data privacy and gradient verification-based consensus protocol to detect poisoning attacks. We compare our method with two similar methods on a real-world diabetes dataset. Promising experimental results show that our method can achieve high model accuracy in acceptable running time while also showing good performance in reducing the privacy budget consumption and resisting poisoning attacks. [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]

Electric shovels are widely used in the mining industry to dig ore, and the teeth in shovels' bucket can be lost due to the tremendous pressure exerted by ore materials during operation. When the teeth fall off and enter the crusher with other ore materials, serious damages to crusher gears and other equipment happen, which causes millions of economic loss, because it is made of high-manganese steel. Thus, it is urgent to develop an efficient and automatic algorithm for detecting broken teeth. However, existing methods for detecting broken teeth have little effect and most research studies depended on sensor skills, which will be disturbed by closed cavity in shovel and not stable in practice. In this paper, we present an intelligent computer vision system for monitoring teeth condition and detecting missing teeth. Since the pixel-level algorithm is carried out, the amount of calculation should be reduced to improve the superiority of the algorithm. To release computational pressure of subsequent work, salient detection based on deep learning is proposed for extracting the key frame images from video flow taken by the camera installed on the shovel including the teeth we intend to analyze. Additionally, in order to more efficiently monitor teeth condition and detect missing teeth, semantic segmentation based on deep learning is processed to get the relative position of the teeth in the image. Once semantic segmentation is done, floating images containing the shape of teeth are obtained. Then, to detect missing teeth effectively, image registration is proposed. Finally, the result of image registration shows whether teeth are missing or not, and the system will immediately alert staff to check the shovel when teeth fall off. Through sufficient experiments, statistical result had demonstrated superiority of our presented model that serves more promising prospect in mining industry. [ABSTRACT FROM AUTHOR]

In the context of economic globalization and digitization, the current financial field is in an unprecedented complex situation. The methods and means to deal with this complexity are developing towards image intelligence. This paper takes financial prediction as the starting point, selects the artificial neural network in the intelligent algorithm and optimizes the algorithm, forecasts through the improved multilayer neural network, and compares it with the traditional neural network. Through comparison, it is found that the prediction success rate of the improved genetic multilayer neural network increases with the increase of the dimension of the input image data. This shows that, by adding more technical indicators as the input of the combined network, the prediction efficiency of the improved genetic multilayer neural network can be further improved and the advantage of computing speed can be maintained. [ABSTRACT FROM AUTHOR]

With the continuous application of the art industry in various fields, more and more people choose to systematically learn the knowledge of the art industry. In the art major, image painting is one of the important contents of the art major. How to improve students' aesthetic quality and comprehensive professional quality is studied, in which the content learning of image painting art is the key. Therefore, we have carried out technical exploration and result analysis based on Gaussian mutation genetic algorithm to optimize the application of neural network in image painting art teaching. We use Gaussian mutation genetic algorithm to study the neural network optimized teaching cloud platform technology. Compared with the traditional algorithm, the algorithm proposed in this paper has more funny computational efficiency, being able to comprehensively evaluate and improve students' aesthetic quality and comprehensive professional quality. Gaussian mutation genetic algorithm can effectively improve the knowledge search ability of the platform and the running speed of the teaching platform. In the future research in the field of art industry, neural network will optimize the teaching cloud platform technology, which has laid a solid foundation for improving students' aesthetic quality and comprehensive professional quality. [ABSTRACT FROM AUTHOR]

An adaptive clamping method (SGD-MS) based on the radius of curvature is designed to alleviate the local optimal oscillation problem in deep neural network, which combines the radius of curvature of the objective function and the gradient descent of the optimizer. The radius of curvature is considered as the threshold to separate the momentum term or the future gradient moving average term adaptively. In addition, on this basis, we propose an accelerated version (SGD-MA), which further improves the convergence speed by using the method of aggregated momentum. Experimental results on several datasets show that the proposed methods effectively alleviate the local optimal oscillation problem and greatly improve the convergence speed and accuracy. A novel parameter updating algorithm is also provided in this paper for deep neural network. [ABSTRACT FROM AUTHOR]

The current Internet data explosion is expecting an ever-higher demand for text emotion analysis that greatly facilitates public opinion analysis and trend prediction, among others. Therefore, this paper proposes to use a dual-channel convolutional neural network (DCNN) algorithm to analyze the semantic features of English text big data. Following the analysis of the effect of CNN, artificial neural network (ANN), and recurrent neural network (RNN) on English text data analysis, the more effective long short-term memory (LSTM) and the gated recurrent unit (GRU) neural network (NN) are introduced, and each network is combined with the dual-channel CNN, respectively, and comprehensively analyzed under comparative experiments. Second, the semantic features of English text big data are analyzed through the improved SO-pointwise mutual information (SO-PMI) algorithm. Finally, the ensemble dual-channel CNN model is established. Under the comparative experiment, GRU NN has a better feature detection effect than LSTM NN, but the performance increase from dual-channel CNN to GRU NN + dual-channel CNN is not obvious. Under the comparative analysis of GRU NN + dual-channel CNN model and LSTM NN + dual-channel CNN model, GRU NN + dual-channel CNN model ensures the high accuracy of semantic feature analysis and improves the analysis speed of the model. Further, after the attention mechanism is added to the GRU NN + dual-channel CNN model, the accuracy of semantic feature analysis of the model is improved by nearly 1.3%. Therefore, the ensemble model of GRU NN + dual-channel CNN + attention mechanism is more suitable for semantic feature analysis of English text big data. The results will help the e-commerce platform to analyze the evaluation language and semantic features for the current network English short texts. [ABSTRACT FROM AUTHOR]

Error-Correcting Output Codes has become a well-known, established technique for multiclass classification due to its simplicity and efficiency. Each binary split contains different original classes. A noncompetent classifier emerges when it classifies an instance whose real class does not belong to the metasubclasses which is used to learn the classifier. How to reduce the error caused by the noncompetent classifiers under diversity big enough is urgent for ECOC classification. The weighted decoding strategy can be used to reduce the error caused by the noncompetence contradiction through relearning the weight coefficient matrix. To this end, a new weighted decoding strategy taking the classifier competence reliability into consideration is presented in this paper, which is suitable for any coding matrix. Support Vector Data Description is applied to compute the distance from an instance to the metasubclasses. The distance reflects the competence reliability and is fused as the weight in the base classifier combination. In so doing, the effect of the competent classifiers on classification is reinforced, while the bias induced by the noncompetent ones is decreased. Reflecting the competence reliability, the weights of classifiers for each instance change dynamically, which accords with the classification practice. The statistical simulations based on benchmark datasets indicate that our proposed algorithm outperforms other methods and provides new thought for solving the noncompetence problem. [ABSTRACT FROM AUTHOR]

With the development of medical informatization, the data related to medical field are growing at an amazing speed, and medical big data appears. The mining and analysis of these data plays an important role in the prediction, monitoring, diagnosis, and treatment of tumor diseases. Therefore, this paper proposes a clustering algorithm of the high-order simulated annealing neural network algorithm and uses this algorithm to extract tumor disease-related big data, constructs training set according to the relevant information mined, designs a kind of dimension reduction model, aiming at the problem of excessive and wrong diagnosis and treatment in the diagnosis and treatment module of tumor disease monitoring mode, and establishes the corresponding control mechanism, so as to optimize the tumor disease monitoring mode. The results show that the clustering accuracy of the high-order simulated annealing neural network algorithm on different data sets (iris, wine, and Pima India diabetes) is 97.33%, 82.11%, and 70.56% and the execution time is 0.75 s, 0.562 s, and 1.092 s, which are better than those of the fast k-medoids algorithm and improved k-medoids clustering algorithm. To sum up, the high-order simulated annealing neural network algorithm can achieve good clustering effect in medical big data mining. The establishment of model M1 can reduce the probability of excessive and wrong medical treatment and improve the effectiveness of diagnosis and treatment module monitoring in tumor disease monitoring mode. [ABSTRACT FROM AUTHOR]

With the rapid development of deep learning algorithms, it is gradually applied in UAV (Unmanned Aerial Vehicle) driving, visual recognition, target tracking, behavior recognition, and other fields. In the field of sports, many scientists put forward the research of target tracking and recognition technology based on deep learning algorithms for athletes' trajectory and behavior capture. Based on the target tracking algorithm, a regional proposal network RPN algorithm combined with the twin regional proposal network Siamese algorithm is proposed to study the tracking and recognition technology of athletes' behavior. Then, the adaptive updating network is used to track the behavior target of athletes, and the simulation model of behavior recognition is established. This algorithm is different from the traditional twin network algorithm. It can accurately take the athlete's behavior as the target candidate box in model training and reduce the interference of environment and other factors on model recognition. The results show that the Siamese-RPN algorithm can reduce the interference from the background and environment when tracking the athletes' target behavior trajectory. This algorithm can improve the training behavior recognition model, ignore the background interference elements of the behavior image, and improve the accuracy and overall performance of the model. Compared with the traditional twin network method for sports behavior recognition, the Siamese-RPN algorithm studied in this paper can perform offline operations and distinguish the interference factors of athletes' background environment. It can quickly capture the characteristic points of athletes' behavior as the data input of the tracking model, so it has excellent popularization and application value. [ABSTRACT FROM AUTHOR]

Multiscale brings great benefits for people to observe objects or problems from different perspectives. Multiscale clustering has been widely studied in various disciplines. However, most of the research studies are only for the numerical dataset, which is a lack of research on the clustering of nominal dataset, especially the data are nonindependent and identically distributed (Non-IID). Aiming at the current research situation, this paper proposes a multiscale clustering framework based on Non-IID nominal data. Firstly, the benchmark-scale dataset is clustered based on coupled metric similarity measure. Secondly, it is proposed to transform the clustering results from benchmark scale to target scale that the two algorithms are named upscaling based on single chain and downscaling based on Lanczos kernel, respectively. Finally, experiments are performed using five public datasets and one real dataset of the Hebei province of China. The results showed that the method can provide us not only competitive performance but also reduce computational cost. [ABSTRACT FROM AUTHOR]

Nowadays, with the constant change of public aesthetic standards, a large number of new types and themes of film programs have emerged. For this reason, this paper proposes an improved neural network optimized by mutation ant colony algorithm for automatic acquisition of film labels, which not only overcomes the disadvantages of traditional neural network, such as difficulty in determining weights, slow convergence speed, and easiness to fall into local minimum, but also makes up for the shortcomings faced by using ant colony algorithm alone through the gradient information of quantum genetic algorithm neural network. The results show that the user similarity judgment is added in the process of calculating the user rating deviation between movies, and the neighbor chooses to add the movie tag weight and rating similarity as the basis for the neighbor selection of the target movie in the process of predicting the target movie rating. Experiments show the effectiveness of the algorithm. [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]

In this paper, a new metaheuristic optimization algorithm, called social network search (SNS), is employed for solving mixed continuous/discrete engineering optimization problems. The SNS algorithm mimics the social network user's efforts to gain more popularity by modeling the decision moods in expressing their opinions. Four decision moods, including imitation, conversation, disputation, and innovation, are real-world behaviors of users in social networks. These moods are used as optimization operators that model how users are affected and motivated to share their new views. The SNS algorithm was verified with 14 benchmark engineering optimization problems and one real application in the field of remote sensing. The performance of the proposed method is compared with various algorithms to show its effectiveness over other well-known optimizers in terms of computational cost and accuracy. In most cases, the optimal solutions achieved by the SNS are better than the best solution obtained by the existing methods. [ABSTRACT FROM AUTHOR]

Personalized courses recommendation technology is one of the hotspots in online education field. A good recommendation algorithm can stimulate learners' enthusiasm and give full play to different learners' learning personality. At present, the popular collaborative filtering algorithm ignores the semantic relationship between recommendation items, resulting in unsatisfactory recommendation results. In this paper, an algorithm combining knowledge graph and collaborative filtering is proposed. Firstly, the knowledge graph representation learning method is used to embed the semantic information of the items into a low-dimensional semantic space; then, the semantic similarity between the recommended items is calculated, and then, this item semantic information is fused into the collaborative filtering recommendation algorithm. This algorithm increases the performance of recommendation at the semantic level. The results show that the proposed algorithm can effectively recommend courses for learners and has higher values on precision, recall, and F1 than the traditional recommendation algorithm. [ABSTRACT FROM AUTHOR]

A band selection algorithm named space and information comprehensive evaluation model (SICEM) is proposed in this paper, which reconstitutes the hyperspectral imagery by building an optimal subset to replace the original spectrum. SICEM reduces the dimensions while keeping the vital information of an image, and these are accomplished through two phases. Specifically, the improved fast density peaks clustering (I-FDPC) algorithm is employed to pick out the scattered bands in geometric space to generate a candidate set U at first. Then, we conduct pruning in U through iterative information analysis until the target set Ω is built. In this phase, we need to calculate comprehensive information score (CIS) for every member in U after assigning weights to the amount of information (AoI) and correlation. In each iteration, the band with highest score is selected into Ω , and the ones highly related to it will be removed out of U via a threshold. Compared with the four state-of-the-art unsupervised algorithms on real-world HSI datasets (IndianP and PaviaU), we find that SICEM has strong ability to form an optimal reduced-dimension combination with low correlation and rich information and it performs well in discrete band distribution, accuracy, consistency, and stability. [ABSTRACT FROM AUTHOR]

The technology world is developing fast with the developments made in the hardware and software areas. Considering that privacy and security of telemedicine applications are among the main necessities of this industry, as a result, there is a need to use lightweight and practical algorithms to be used in applications in the field of telemedicine, while security have the least negative impact. The distinct and contradicting components in the design and implementation of the cryptography algorithm, to achieve various objectives in medicine-based applications, have made it a complicated system. It is natural that, without identifying the components, indices, and properties of each system component, the hardware and software resources are lost and a proper algorithm cannot be designed. Accordingly, this paper presents a leveled model of cryptography algorithms using the cybernetic method. First, the main objectives and measures in the design of the cryptography algorithms are extracted using the measure reduction methods, and some of the excess and overlapping measures are eliminated. Then, three general classes of the cryptography algorithm design and implementation measures, applications of cryptography algorithms, and cryptography implementation techniques are extracted. Since the complexity of the cryptography algorithm design is relatively high, the cybernetic methodology is used to present a supermodel to make the cryptography algorithm design objective. Such design prevents examining unnecessary details and establishes a bidirectional relationship between the main design and implementation process and the support process. This relationship provides the support requirements of the main process by the support process at each step. Finally, the Q-analysis tools are used to analyse the proposed method, and the efficiency results are represented. [ABSTRACT FROM AUTHOR]

In real life, people's life gradually tends to be simple, so the convenience of online shopping makes more and more research begin to explore the convenience optimization of shopping, in which the fitting system is the research product. However, due to the immaturity of the virtual fitting system, there are a lot of problems, such as the expression of clothing color is not clear or deviation. In view of this, this paper proposes a 3D clothing color display model based on deep learning to support human modeling-driven. Firstly, the macro-micro adversarial network (MMAN) based on deep learning is used to analyze the original image, and then, the results are preprocessed. Finally, the 3D model with the original image color is constructed by using UV mapping. The experimental results show that the accuracy of the MMAN algorithm reaches 0.972, the established three-dimensional model is emotional enough, the expression of the clothing color is clear, and the difference between the color difference and the original image is within 0.01, and the subjective evaluation of volunteers is more than 90 points. The above results show that it is effective to use deep learning to build a 3D model with the original picture clothing color, which has great guiding significance for the research of character model modeling and simulation. [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]

With the development of society and the promotion of science and technology, English, as the largest universal language in the world, is used by more and more people. In the life around us, there is information in English all the time. However, because the process of manual recognition of English letters is very labor-intensive and inefficient, the demand for computer recognition of English letters is increasing. This paper studies the influence of the parameters of BP neural network and genetic algorithm on the whole network, including the input, output, and number of hidden layer nodes. Finally, it improves and determines the settings and values of the relevant parameters. On this basis, it shows the rationality of the selected parameters through experiments. The results show that only GA-BP neural network and feature data mining algorithm can complete feature extraction and become the main function of feature classification at the same time. After enough initial data sample analysis training, the GA-BP neural network was found to have good data fault tolerance and feature recognition. The experimental results show that the genetic algorithm can find the best weights and thresholds and the weights and thresholds are given to the BP neural network. After training, the recognition of handwritten letters can be realized. Finally, the convergence of the two algorithms is compared through experiments, which shows that the overall performance of the BP neural network algorithm is improved after genetic algorithm optimization. It can be seen that the genetic algorithm has a good effect in improving the BP neural network and this method has a broad prospect in English feature recognition. [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]

Manuscript management plays an important role in the whole periodical industry. Journals and magazine society receive different types of contribution documents from all over the world. Many submission files are mostly transmitted by e-mail, but there are some hidden disadvantages in e-mail. In view of this situation, this paper studies the establishment and optimization simulation of manuscript management system based on fuzzy genetic neural network (FGNN). On the basis of genetic neural network, combined with the advantages of FNN neural network algorithm, a FGNN structure is established to optimize the system, which is helpful to the learning and expression ability of the whole system. The results show that the FGNN can extract and express the structured data, and the submission management system runs faster. Then, UML modeling and PHP framework are used to realize the design and establishment of the system, and the simulation model of contribution system is constructed. The innovation of this study is to combine genetic neural network with FNN neural network, which can query, manage, and classify manuscripts quickly. It also improves the complex submission system and optimizes the submission process. The whole journal editing work has been effectively improved. [ABSTRACT FROM AUTHOR]

Lung cancer is the uncontrolled growth of cells in the lung that are made up of two spongy organs located in the chest. These cells may penetrate outside the lungs in a process called metastasis and spread to tissues and organs in the body. In this paper, using image processing, deep learning, and metaheuristic, an optimal methodology is proposed for early detection of this cancer. Here, we design a new convolutional neural network for this purpose. Marine predators algorithm is also used for optimal arrangement and better network accuracy. The method finally applied to RIDER dataset, and the results are compared with some pretrained deep networks, including CNN ResNet-18, GoogLeNet, AlexNet, and VGG-19. Final results showed higher results of the proposed method toward the compared techniques. The results showed that the proposed MPA-based method with 93.4% accuracy, 98.4% sensitivity, and 97.1% specificity provides the highest efficiency with the least error (1.6) toward the other state of the art methods. [ABSTRACT FROM AUTHOR]

Target detection in remote sensing images is very challenging research. Followed by the recent development of deep learning, the target detection algorithm has obtained large and fast growth. However, in the application of remote sensing images, due to the small target, wide range, small texture, and complex background, the existing target detection methods cannot achieve people's hope. In this paper, a target detection algorithm named IR-PANet for remote sensing images of an automobile is proposed. In the backbone network CSPDarknet53, SPP is used to strengthen the learning content. Then, IR-PANet is used as the neck network. After the upper sampling, depthwise separable convolution is used to greatly avoid the lack of small target feature information in the convolution of the shallow network and increase the semantic information in the high-level network. Finally, Gamma correction is used to preprocess the image before image training, which effectively reduces the interference of shadow and other factors on training. The experiment proves that the method has a better effect on small targets obscured by shadows and under the color similar to the background of the picture, and the accuracy is significantly improved based on the original algorithm. [ABSTRACT FROM AUTHOR]

With the advent of the artificial intelligence era, target adaptive tracking technology has been rapidly developed in the fields of human-computer interaction, intelligent monitoring, and autonomous driving. Aiming at the problem of low tracking accuracy and poor robustness of the current Generic Object Tracking Using Regression Network (GOTURN) tracking algorithm, this paper takes the most popular convolutional neural network in the current target-tracking field as the basic network structure and proposes an improved GOTURN target-tracking algorithm based on residual attention mechanism and fusion of spatiotemporal context information for data fusion. The algorithm transmits the target template, prediction area, and search area to the network at the same time to extract the general feature map and predicts the location of the tracking target in the current frame through the fully connected layer. At the same time, the residual attention mechanism network is added to the target template network structure to enhance the feature expression ability of the network and improve the overall performance of the algorithm. A large number of experiments conducted on the current mainstream target-tracking test data set show that the tracking algorithm we proposed has significantly improved the overall performance of the original tracking algorithm. [ABSTRACT FROM AUTHOR]

In recent years, the application of the gradient boosting-back propagation (GB-BP) neural network algorithm in many industries has brought huge benefits, so how to combine the GB-BP neural network algorithm with sports has become a research hotspot. Based on this, this paper studies the application of the GB-BP neural network algorithm in wrestling, designs the sports athletes action recognition and classification model based on the GB-BP neural network algorithm, first analyzes the research status of wrestling action recognition, and then optimizes and improves the shortcomings of action recognition and big data analysis technology. The GB-BP neural network algorithm can realize the accurate recognition and classification of wrestlers' training actions and carry out big data mining analysis with known action recognition, so as to achieve accurate classification. The experimental results show that the model can play a good role in wrestling and effectively improve the efficiency of wrestlers in training. [ABSTRACT FROM AUTHOR]

The reinforcement learning algorithms based on policy gradient may fall into local optimal due to gradient disappearance during the update process, which in turn affects the exploration ability of the reinforcement learning agent. In order to solve the above problem, in this paper, the cross-entropy method (CEM) in evolution policy, maximum mean difference (MMD), and twin delayed deep deterministic policy gradient algorithm (TD3) are combined to propose a diversity evolutionary policy deep reinforcement learning (DEPRL) algorithm. By using the maximum mean discrepancy as a measure of the distance between different policies, some of the policies in the population maximize the distance between them and the previous generation of policies while maximizing the cumulative return during the gradient update. Furthermore, combining the cumulative returns and the distance between policies as the fitness of the population encourages more diversity in the offspring policies, which in turn can reduce the risk of falling into local optimal due to the disappearance of the gradient. The results in the MuJoCo test environment show that DEPRL has achieved excellent performance on continuous control tasks; especially in the Ant-v2 environment, the return of DEPRL ultimately achieved a nearly 20% improvement compared to TD3. [ABSTRACT FROM AUTHOR]

Data-driven intelligent prognostic health management (PHM) systems have been widely investigated in the area of defective bearing signals. These systems can provide precise information on condition monitoring and diagnosis. However, existing PHM systems cannot identify the accurate degradation trend and the current fault types simultaneously. Given that different fault types have various effects on the mechanical system, the corresponding maintenance strategies also vary. Then, choosing the appropriate maintenance strategy according to the future fault type can reduce the maintenance cost of the equipment operation. Therefore, a multifeature information health index (MIHI) must be developed to trace various bearing degradation trends with various types of faults simultaneously. This paper reports a new quasi-orthogonal sparse project algorithm that can mutually convert the degraded processing feature vector sets (such as spectrum) for each type of fault to orthogonal approximate spatial straight lines. The algorithm builds a MIHI through the spectrum of current state measured points. The MIHI is then transformed by a quasi-orthogonal sparse project algorithm to trace the various bearing degradation trends and recognize the fault type simultaneously. The case study of bearing degradation data demonstrates that this approach is effective in assessing the various degradation trends of different fault types. [ABSTRACT FROM AUTHOR]

A number of literature reports have shown that multi-view clustering can acquire a better performance on complete multi-view data. However, real-world data usually suffers from missing some samples in each view and has a small number of labeled samples. Additionally, almost all existing multi-view clustering models do not execute incomplete multi-view data well and fail to fully utilize the labeled samples to reduce computational complexity, which precludes them from practical application. In view of these problems, this paper proposes a novel framework called Semi-supervised Multi-View Clustering with Weighted Anchor Graph Embedding (SMVC_WAGE), which is conceptually simple and efficiently generates high-quality clustering results in practice. Specifically, we introduce a simple and effective anchor strategy. Based on selected anchor points, we can exploit the intrinsic and extrinsic view information to bridge all samples and capture more reliable nonlinear relations, which greatly enhances efficiency and improves stableness. Meanwhile, we construct the global fused graph compatibly across multiple views via a parameter-free graph fusion mechanism which directly coalesces the view-wise graphs. To this end, the proposed method can not only deal with complete multi-view clustering well but also be easily extended to incomplete multi-view cases. Experimental results clearly show that our algorithm surpasses some state-of-the-art competitors in clustering ability and time cost. [ABSTRACT FROM AUTHOR]

Parameter tuning of PID controller for liquid level control of beer filling machine was studied in this paper, which can meet the demand of accurate controlling in beer production and improve the rapidity under the same conditions. Firstly, an improved genetic algorithm was proposed which has been verified by eight kinds of test functions. Simulation results revealed that, in comparation with other modified particle swarm optimization algorithm and modified genetic algorithm, the algorithm proposed in this work is not only capable to improve the convergence speed and precision under the same experimental conditions but also to improve the probability to converge to the optimal value. Finally, the proposed algorithm was applied to the parameter tuning of the PID controller of beer filling machine for liquid level control. Superior property had been obtained, which implied an effective improvement in the rapidity with the premise of steady-state error exclusion. [ABSTRACT FROM AUTHOR]

The current unsupervised domain adaptation person re-identification (re-ID) method aims to solve the domain shift problem and applies prior knowledge learned from labelled data in the source domain to unlabelled data in the target domain for person re-ID. At present, the unsupervised domain adaptation person re-ID method based on pseudolabels has obtained state-of-the-art performance. This method obtains pseudolabels via a clustering algorithm and uses these pseudolabels to optimize a CNN model. Although it achieves optimal performance, the model cannot be further optimized due to the existence of noisy labels in the clustering process. In this paper, we propose a stable median centre clustering (SMCC) for the unsupervised domain adaptation person re-ID method. SMCC adaptively mines credible samples for optimization purposes and reduces the impact of label noise and outliers on training to improve the performance of the resulting model. In particular, we use the intracluster distance confidence measure of the sample and its K-reciprocal nearest neighbour cluster proportion in the clustering process to select credible samples and assign different weights according to the intracluster sample distance confidence of samples to measure the distances between different clusters, thereby making the clustering results more robust. The experiments show that our SMCC method can select credible and stable samples for training and improve performance of the unsupervised domain adaptation model. Our code is available at https://github.com/sunburst792/SMCC-method/tree/master. [ABSTRACT FROM AUTHOR]

The advanced analysis and research methods of big data will provide theoretical support for the integration of athletes' talent training. The advanced technological methods of big data will also give full play to the advantages of tapping the potential of talents and actively improve the success rate of grassroots young athletes. This paper proposes an improved Adaptive Particle Swarm Optimization (APSO) algorithm for the optimization of radial basis function (RBF) neural network parameters. The basic structure of RBF neural network is introduced, and the influence of parameters on the performance of RBF neural network is analyzed. The optimization method of RBF neural network parameters is analyzed, and Particle Swarm Optimization (PSO) algorithm is selected as the parameter optimization method of RBF neural network. In addition, an improved APSO algorithm is proposed according to the advantages and disadvantages of PSO and compared with other PSO algorithms. Experimental results show that the improved PSO algorithm has better accuracy. The improved PSO algorithm is applied to the parameter optimization of RBF neural network, and the experimental results prove the superiority of the proposed method. By weighting the second-level indicators, the weights of the second-level indicators of athletes' competitive ability are in order of skill, athletic quality, psychological ability, and artistic expression. Skills are the main factors that determine the level of competitive ability. Sports quality and psychological ability are important guarantees for supporting the normal performance of skills. Artistic expressiveness is a supplementary factor for competitive ability. The various elements cooperate with each other and interact with each other. The indicators do not exist alone but cooperate with each other to support the formation of the entire athletic ability system. In the content of the competitive ability index of excellent athletes, technical ability is the core, and sports quality, psychological ability, and artistic performance ability ultimately exist to serve the improvement of technical ability. The competition scores of the 100 athletes counted in this article are all above 9.0 points. The difference between APSO-RBF's action quality scores of 100 athletes and the real value is less than 3%. In terms of movement difficulty, the APSO-RBF evaluated athletes' scores are close to 1.65 points, which is basically the same as the real value. [ABSTRACT FROM AUTHOR]

In the process of product collaborative design, the association between designers can be described by a complex network. Exploring the importance of the nodes and the rules of information dissemination in such networks is of great significance for distinguishing its core designers and potential designer teams, as well as for accurate recommendations of collaborative design tasks. Based on the neighborhood similarity model, combined with the idea of network information propagation, and with the help of the ReLU function, this paper proposes a new method for judging the importance of nodes—LLSR. This method not only reflects the local connection characteristics of nodes but also considers the trust degree of network propagation, and the neighbor nodes' information is used to modify the node value. Next, in order to explore potential teams, an LA-LPA algorithm based on node importance and node similarity was proposed. Before the iterative update, all nodes were randomly sorted to get an update sequence which was replaced by the node importance sequence. When there are multiple largest neighbor labels in the propagation process, the label with the highest similarity is selected for update. The experimental results in the related networks show that the LLSR algorithm can better identify the core nodes in the network, and the LA-LPA algorithm has greatly improved the stability of the original LPA algorithm and has stably mined potential teams in the network. [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]

Elephant herding optimization (EHO) has received widespread attention due to its few control parameters and simple operation but still suffers from slow convergence and low solution accuracy. In this paper, an improved algorithm to solve the above shortcomings, called Gaussian perturbation specular reflection learning and golden-sine-mechanism-based EHO (SRGS-EHO), is proposed. First, specular reflection learning is introduced into the algorithm to enhance the diversity and ergodicity of the initial population and improve the convergence speed. Meanwhile, Gaussian perturbation is used to further increase the diversity of the initial population. Second, the golden sine mechanism is introduced to improve the way of updating the position of the patriarch in each clan, which can make the best-positioned individual in each generation move toward the global optimum and enhance the global exploration and local exploitation ability of the algorithm. To evaluate the effectiveness of the proposed algorithm, tests are performed on 23 benchmark functions. In addition, Wilcoxon rank-sum tests and Friedman tests with 5% are invoked to compare it with other eight metaheuristic algorithms. In addition, sensitivity analysis to parameters and experiments of the different modifications are set up. To further validate the effectiveness of the enhanced algorithm, SRGS-EHO is also applied to solve two classic engineering problems with a constrained search space (pressure-vessel design problem and tension-/compression-string design problem). The results show that the algorithm can be applied to solve the problems encountered in real production. [ABSTRACT FROM AUTHOR]