Search

With the continuous deepening of the urbanization process and the progress of science and technology, people transform nature and develop nature on a larger and larger scale, among which the most iconic transformation is a variety of building structures built by people. And with the passage of time, the building structure in the perennial wind and sun, there will be signs of "illness", if not timely treatment, it will have a huge impact on the stability and safety of the building structure. Based on this, in this paper, according to the characteristics of crack identification on the surface of concrete structure, background subtraction algorithm is selected for image noise reduction processing. Through three steps of digital image noise reduction, crack extraction and crack parameter identification, the quantitative recognition of cracks is completed and a complete system of crack parameter identification is formed. The experimental results show that the machine learning model of building structure health monitoring and damage recognition algorithm proposed in this paper has excellent statistical performance, and the relative error accuracy of recognition can be controlled within 10%. [ABSTRACT FROM AUTHOR]

In order to avoid the risk of patients' private information leakage, this paper puts forward a research on the protection of medical Internet private information based on double chaotic encryption algorithm. This paper analyzes the quantification of risk indicators for privacy information protection of medical Internet, establishes the risk quantification structure of health care big data according to the quantitative calculation results, and puts forward the strategy of controlling access to health care big data, configuring the risk level, describing the attributes of the system database, and realizing the privacy information protection of medical Internet under the double chaotic encryption algorithm. The experimental results show that the real identity of patients is protected to a certain extent in the protection of private information of medical internet after applying this method. Moreover, this method has high storage integrity and small storage standard deviation, and the method in this paper can effectively resist network intrusion. Therefore, it shows that this method has a good effect of protecting private information of medical Internet. [ABSTRACT FROM AUTHOR]

The research of biomedical data is crucial for disease diagnosis, health management, and medicine development. However, biomedical data are usually characterized by high dimensionality and class imbalance, which increase computational cost and affect the classification performance of minority class, making accurate classification difficult. In this paper, we propose a biomedical data classification method based on feature selection and data resampling. First, use the minimal-redundancy maximal-relevance (mRMR) method to select biomedical data features, reduce the feature dimension, reduce the computational cost, and improve the generalization ability; then, a new SMOTE oversampling method (Spectral-SMOTE) is proposed, which solves the noise sensitivity problem of SMOTE by an improved spectral clustering method; finally, the marine predators algorithm is improved using piecewise linear chaotic maps and random opposition-based learning strategy to improve the algorithm's optimization seeking ability and convergence speed, and the key parameters of the spectral-SMOTE are optimized using the improved marine predators algorithm, which effectively improves the performance of the over-sampling approach. In this paper, five real biomedical datasets are selected to test and evaluate the proposed method using four classifiers, and three evaluation metrics are used to compare with seven data resampling methods. The experimental results show that the method effectively improves the classification performance of biomedical data. Statistical test results also show that the proposed PRMPA-Spectral-SMOTE method outperforms other data resampling methods. [ABSTRACT FROM AUTHOR]

This paper proposes a method of beforehand prediction of electric equipment faults based on chain-linked recurrent neural network algorithm, which takes the operating parameters of power equipment and other relevant environmental factors as inputs, and takes the fault characteristics as output judgment marks, and constructs a machine learning training model to realize the prediction of power equipment faults. The neural network algorithm adopted in this paper adopts a tree structure. Each sub-node can transfer information with its multiple superior nodes, so that the correlation between the data of the front and back nodes can be obtained, which meets the needs of the equipment fault prediction model. Considering that the occurrence of power transformer faults is sudden and greatly affected by changes in the surrounding environment, the input of prediction algorithms should consider more environmental factors. This method takes the historical data of various parameters including meteorological phenomena, geography data, and temperature of adjacent equipment and facilities as the training sample set, improves the learning model, gives the trend curve of each index, and gives a prompt at its threshold to ensure the prediction accuracy and give the index prediction. [ABSTRACT FROM AUTHOR]

In this paper, we proposed classification and clustering algorithms that are proper for analyzing customer-related datasets, which are mostly high-dimensional with too many instances. For the clustering purpose, This paper presents a Cuckoo-Search-based Variable Weighting (CSVW) Clustering algorithm to obtain optimal variable weights of high-dimensional data for each cluster. This paper also proposes a deep Inferarer Classifier for categorizing customers using Bi-Directional Long Short-Term Memory (Bi-LSTM) neural network, which uses a Fuzzy Inferential Classifier on its last layer. The Insurance Company (TIC) and InstaCart datasets are utilized for the experiments and performance evaluation. Simulation results reveal that the proposed clustering algorithm generates appropriate Silhouette and Elbow criteria scores in a few cycles of execution in comparison to ordinal clustering algorithms. Also, the proposed classification algorithm with fuzzy soft-max classifier hits the better Classification Criteria in comparison. [ABSTRACT FROM AUTHOR]

In response to the low efficiency and poor quality of current seed optimization algorithms for multi-threshold image segmentation, this paper proposes the utilization of the normal distribution in the cluster distribution mathematical model, the Levy flight mechanism, and the differential evolution algorithm to address the deficiencies of the seed optimization algorithm. The main innovation lies in applying the BBO algorithm to image multi threshold segmentation, providing a new perspective and method for image segmentation tasks. The second significant progress is the combination of Levy flight dynamics and differential evolution algorithm (DEA) to improve the BBO algorithm, thereby enhancing its performance and image segmentation quality. Therefore, a multi-threshold image segmentation model based on the optimized seed optimization algorithm is developed. The experimental results showed that on the function f1, the iteration of the improved seed optimization algorithm was 53, the Generational Distance value was 0.0020, the Inverted Generational Distance value was 0.098, and the Spacing value was 0.051. Compared with the other two algorithms, the improved seed optimization algorithm has better image segmentation performance and clearer image segmentation details. In summary, compared with existing multi-threshold image segmentation methods, the proposed multi-threshold image segmentation model based on the improved seed optimization algorithm has a better image segmentation effect and higher efficiency, can significantly improve the quality of image segmentation, has positive significance for the development of image processing technology, and also provides references for the improvement and application of optimization algorithms. [ABSTRACT FROM AUTHOR]

The existing negative selection algorithms can not improve their detection performance by human intervention during the testing process. This paper proposes a negative selection algorithm with human-in-the-loop for anomaly detection. It uses self-sample clusters to train detectors with a nonrandom strategy. Its detectors and self-sample clusters fully cover state space without overlapping each other. It locally adjusts detectors and self-sample clusters with human intervention to improve its detection performance during the testing process. Experiments were performed on two synthetic datasets and the Iris dataset from the UCI repository to assess its performance. The results show that it outperforms the other anomaly detection methods in most cases. [ABSTRACT FROM AUTHOR]

This paper presents an in-depth study and analysis of oil painting classification and simulation using an improved embedded learning fusion vision perception algorithm. This paper analyzes and models the image quality evaluation problem by simulating the human visual system and extracting quality perception features as the main entry point to improve the prediction accuracy of the overall algorithm. This paper proposes a multi-classification method of CCNN, which uses the similarity measure based on information first to achieve multi-classification of artwork styles and artists, and this part is the main part of this paper. This paper uses the wiki art repository to construct a dataset of oil paintings, including over 2000 works by 20 artists in 13 styles. CNN achieves an accuracy of 85.75% on the artist classification task, which is far more effective than traditional deep learning networks such as Resnet. Finally, we use the network model of this paper and other network models to train the classification of 3, 4, and 6 categories of art images. The accuracy of art image classification by this paper's algorithm is higher than that of the current mainstream convolutional neural network models, and the extracted features are more comprehensive and more accurate than traditional art image feature extraction methods, which do not rely on researchers to extract image features. Experiments show that the proposed method can achieve excellent prediction accuracy for both synthetic distorted images and distorted images. [ABSTRACT FROM AUTHOR]

Crowd counting aims to estimate the number, density, and distribution of crowds in an image. The current mainstream approach, based on CNN, has been highly successful. However, CNN is not without its flaws. Its limited receptive field hampers the modeling of global contextual information, and it struggles to effectively handle scale variation and background complexity. In this paper, we propose a Multi-scale Hybrid Attention Network called MHANet to solve crowd counting challenges more effectively. To address the issue of scale variation, we have developed a Multi-scale Aware Module (MAM) that incorporates multiple sets of dilated convolutions with varying dilation rates. The MAM significantly improves the network's ability to extract information at multiple scales. To tackle the problem of background complexity, we have introduced a Hybrid Attention Module (HAM) that combines spatial attention and channel attention. The HAM effectively directs attention to the crowd region while suppressing background interference, resulting in more accurate counting. MHANet has been extensively experimented on four benchmark datasets and compared against state-of-the-art algorithms. It consistently achieves superior performance in terms of the MAE evaluation metric. MHANet outperforms the current state-of-the-art methods by margins of 1.9%, 5.4%, 0.4%, and 0.8% on the ShanghaiTech Part_A, ShanghaiTech Part_B, UCF-QNRF, and UCF_CC_50 datasets, respectively. Furthermore, a series of ablation experiments targeting MAM and HAM were conducted in this paper, and the experimental results fully demonstrate that MAM and HAM can effectively address the challenges of scale variation and background complexity, ultimately enhancing the accuracy and robustness of the network. [ABSTRACT FROM AUTHOR]

To solve the problem of inaccurate user phase identification, the paper proposes a new algorithm based on improved cloud model and adaptive segmented voltage algorithm. Firstly, the new algorithm uses improved cloud model to calculate the digital features of station area and users' voltage sequences quickly. Secondly, the paper uses the adaptive segmentation voltage algorithm to divide the full voltage sequences into three parts automatically to add local features into phase identification. Finally, the paper calculates cosine similarity between each segmented voltage cloud model to identify users' voltage phase. The analysis based on station data and field verification shows that the new algorithm has not only improved the calculation efficiency by 41% compared with traditional user phase identification algorithm, but also increased the difference in identification results between different phases by 1000 times. In the final result, the accuracy of the new algorithm is 95%. The new algorithm has more obvious differentiation and higher accuracy. The analysis results based on the actual engineering data also prove the feasibility and effectiveness of the new user phase identification algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we present a novel DILTS algorithm that uses a new approach inspired by the energy efficiency of dragonflies. The algorithm optimizes the energy-harvesting mechanisms in IoT devices, inspired by the way dragonflies use wind energy to fly. A sophisticated algorithm optimizes power consumption during task execution, saving energy and speeding up tasks while maintaining the application throughput. The algorithm leverages lazy task scheduling (LTS) to enhance task execution performance. The proposed algorithm evaluates the energy levels of each task and implements an LTS method. This LTS approach improves performance and task management by streamlining scheduling data and reducing overhead. The LTS model reliably optimizes the energy across microbenchmarks and real-time IoT devices. To assess the efficiency and practicality of our algorithm, we compared it to four alternatives. Our novel algorithm outperformed the others with a chip area of 856 μm2, performance speed of 7.11 ns, scheduling accuracy of 94%, and response time of 2.61 ns. Our simulations showed that our proposed method reduced energy consumption by up to 10.02% compared to existing methods. We evaluated the performance of the algorithms on a Zynq 7000 FPGA using the Xilinx Vivado platform via simulations. Our novel algorithm can improve the energy efficiency of green data centers. [ABSTRACT FROM AUTHOR]

The accurate detection of traffic signs is a critical component of self-driving systems, enabling safe and efficient navigation. In the literature, various methods have been investigated for traffic sign detection, among which deep learning-based approaches have demonstrated superior performance compared to other techniques. This paper justifies the widespread adoption of deep learning due to its ability to provide highly accurate results. However, the current research challenge lies in addressing the need for high accuracy rates and real-time processing requirements. In this study, we propose a convolutional neural network based on the YOLOv8 algorithm to overcome the aforementioned research challenge. Our approach involves generating a custom dataset with diverse traffic sign images, followed by conducting training, validation, and testing sets to ensure the robustness and generalization of the model. Experimental results and performance evaluation demonstrate the effectiveness of the proposed method. Extensive experiments show that our model achieved remarkable accuracy rates in traffic sign detection, meeting the real-time requirements of the input data. [ABSTRACT FROM AUTHOR]

Hand-drawn is one of the few visual descriptors that can directly represent visual content, and has significant research in the area of computer vision. Aiming at the problem of sparse features in the realm of hand-drawn image retrieval, hand-drawn images, and the easy deformation of hand-drawn images, this paper proposes a feature extraction method of grid resource sharing collaborative algorithm, which can be obtained utilizing precisely extracted semantic characteristics from hand-drawn images through computer multimedia-aided design Efficient and accurate retrieval results. First, the fundamental framework for obtaining semantic features is algorithm; then the attention model mechanism is the grid resource sharing collaborative introduced in the process of supervised training, and the attention structure block is introduced after the convolutional neural network's bottom layer. To locate effective semantic features, In order to accomplish high-precision retrieval, the attention structure block combines channel attention structure and spatial attention structure to build the attention structure block. The last feature descriptor is then created by combining various semantic feature levels. The proposed strategy is practical and efficient, as demonstrated by the experimental findings on the comparison database Flickr15k. In addition, in the task of hand-drawn image classification, the proposed attention mechanism greatly improves the classification accuracy. [ABSTRACT FROM AUTHOR]

Structure learning is the core of graph model Bayesian Network learning, and the current mainstream single search algorithm has problems such as poor learning effect, fuzzy initial network, and easy falling into local optimum. In this paper, we propose a heuristic learning algorithm HC-PSO combining the HC (Hill Climbing) algorithm and PSO (Particle Swarm Optimization) algorithm, which firstly uses HC algorithm to search for locally optimal network structures, takes these networks as the initial networks, then introduces mutation operator and crossover operator, and uses PSO algorithm for global search. Meanwhile, we use the DE (Differential Evolution) strategy to select the mutation operator and crossover operator. Finally, experiments are conducted in four different datasets to calculate BIC (Bayesian Information Criterion) and HD (Hamming Distance), and comparative analysis is made with other algorithms, the structure shows that the HC-PSO algorithm is superior in feasibility and accuracy. [ABSTRACT FROM AUTHOR]

To improve the effect of intelligent teaching in music classrooms, this paper combines the advanced music waveform iterative reconstruction algorithm to analyze the integration and reconstruction of the music curriculum. Aiming at the problem that the projection matrix occupies a large space and takes a long time to calculate in iterative reconstruction, a fast and real-time incremental method for generating a music wave matrix is proposed. The improved method avoids the judgment and comparison calculations performed by the incremental method when calculating the length and number of each voxel that the ray passes through. The research results show that the music curriculum integration and reconstruction model based on the advanced music waveform iterative reconstruction algorithm can effectively improve the teaching effect of modern music classrooms. [ABSTRACT FROM AUTHOR]

In recent years, UNet and its derivative networks have gained widespread recognition as major methods of medical image segmentation. However, networks like UNet often struggle with Point-of-Care (POC) healthcare applications due to their high number of parameters and computational complexity. To tackle these challenges, this paper introduces an efficient network designed for medical image segmentation called MCU-Net, which leverages ConvNeXt to enhance UNet. 1) Based on ConvNeXt, MCU-Net proposes the MCU Block, which employs techniques such as large kernel convolution, depth-wise separable convolution, and an inverted bottleneck design. To ensure stable segmentation performance, it also integrates global response normalization (GRN) layers and Gaussian Error Linear Unit (GELU) activation functions. 2) Additionally, MCU-Net introduces an enhanced Multi-Scale Convolution Attention (MSCA) module after the original UNet's skip connections, emphasizing medical image features and capturing semantic insights across multiple scales. 3)The downsampling process replaces pooling layers with convolutions, and both upsampling and downsampling stages incorporate batch normalization (BN) layers to enhance model stability during training. The experimental results demonstrate that MCU-Net, with a parameter count of 2.19 million and computational complexity of 19.73 FLOPs, outperforms other segmentation models. The overall performance of MCU-Net in medical image segmentation surpasses that of other models, achieving a Dice score of 91.8% and mIoU of 84.7% on the GlaS dataset. When compared to UNet on the BUSI dataset, MCU-Net shows an improvement of 2% in Dice and 2.9% in mIoU. [ABSTRACT FROM AUTHOR]

The relative entropy fuzzy c-means (REFCM) clustering algorithm improves the robustness of the fuzzy c-means (FCM) algorithm against noise. However, its increased complexity results in slower convergence. To address this issue, we have proposed a suppressed REFCM (SREFCM) algorithm, in which a constant suppression rate, α, is selected. However, in cases where external factors, such as changes in the data structure, are present, relying on a fixed α value may result in a decline in algorithm performance, which is clearly unsuitable. Therefore, the adaptive selection of parameters is a critical step. Based on the data structure itself, this paper proposes an algorithm for adaptive parameter selection utilizing partition entropy coefficient and alternating modified partition coefficient, and compares it to six parameter selection algorithms based on generalized rules: θ′ type, ρ type, β type, τ type, σ type and ξ type. Empirical findings indicate that adapting parameters can enhance the partitioning capability of the algorithm while ensuring a rapid convergence rate. [ABSTRACT FROM AUTHOR]

With the superior development of technology, mobile robots have become an essential part of humans' daily life. Consequently, interacting and dealing with them pushes us to develop and propose different suitable Human-Robot Interaction (HRI) systems that can detect the interacted user's actions and achieve the desired output in real-time. In this paper, we propose a closed-loop smart mechanism for two main agents: the hand gloves' controller and the mobile robot. To be more specific, the developed model employs flex sensors to measure the curve of the finger. The sensor signals are then processed by aiding the Hedge Algebras Algorithm to control the movement direction and customize the speed of the mobile robot via wireless communication. Numerical simulation and experiments demonstrate that the mobile robot could operate reliably, respond rapidly to control signals, and vary its speed continually based on the different finger gestures. Besides, the control results are also compared with those obtained from the traditional fuzzy controller to prove the superiority and efficiency of the proposed method. [ABSTRACT FROM AUTHOR]

Mathematical modeling of many natural and physical phenomena in industry, engineering sciences and basic sciences lead to linear and non-linear devices. In many cases, the coefficients of these devices, taking into account qualitative or linguistic concepts, show their complexity in the form of Z-numbers. Since Z-number involves both fuzziness and reliability or probabilistic uncertainty, it is difficult to obtain the exact solution to the problems with Z-number. In this work, a method and an algorithm are proposed for the approximate solution of a Z-number linear system of equations as an important case of such problems. The paper is devoted to solving linear systems where the coefficients of the variables and right hand side values are Z-numbers. An algorithm is presented based on a ranking scheme and the neural network technique to solve the obtained system. Moreover, two examples are included to describe the procedure of the method and results. [ABSTRACT FROM AUTHOR]

It is obvious that the problem of Frequent Itemset Mining (FIM) is very popular in data mining, which generates frequent itemsets from a transaction database. An extension of the frequent itemset mining is High Utility Itemset Mining (HUIM) which identifies itemsets with high utility from the transaction database. This gains popularity in data mining, because it identifies itemsets which have more value but the same was not identified as frequent by Frequent Itemset Mining. HUIM is generally referred to as Utility Mining. The utility of the items is measured based on parameters like cost, profit, quantity or any other measures preferred by the users. Compared to high utility itemsets (HUIs) mining, high average utility itemsets (HAUIs) mining is more precise by considering the number of items in the itemsets. In state-of-the-art algorithms that mines HUIS and HAUIs use a single fixed minimum utility threshold based on which HAUIs are identified. In this paper, the proposed algorithm mines HAUIs from transaction databases using Artificial Fish Swarm Algorithm (AFSA) with computed multiple minimum average utility thresholds. Computing the minimum average utility threshold for each item with the AFSA algorithm outperforms other state-of-the-art HAUI mining algorithms with multiple minimum utility thresholds and user-defined single minimum threshold in terms of number of HAUIs. It is observed that the proposed algorithm outperforms well in terms of execution time, number of candidates generated and memory consumption when compared to the state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

PCB defect detection aims to identify the presence of gaps, open circuits, short circuits, and other defects in the PCB boards produced in the industry. Designing effective deep learning algorithms is crucial to finding a solution. Previously proposed PCB defect detection algorithms are limited in detecting tiny objects in high-density. Directly applying previous models to tackle PCB defect detection tasks will cause serious issues, such as missed detection and false detection. In this paper, we present a detection algorithm for tiny PCB defect targets in high-density regions to solve the above-mentioned problems. We firstly propose a detection head to detect tiny objects. Then, we design a four-channel feature fusion mechanism to fuse four different scale features and add an attention mechanism to find the attention region in scenarios with dense objects. Finally, we achieved accurate detection of tiny targets in high-density areas. Experiments were performed on the publicly available PCB defect dataset from Peking University. Our mAP@.5:.95 achieves 48.6%, while mAP@0.5 exceeds 90%. Compared with YOLOX and YOLOv5, our improved model can better localize tiny objects in high-density scenes. The experimental results certify that our model can obtain higher performance in comparison with the baseline and the state of the art. [ABSTRACT FROM AUTHOR]

Due to the dynamic nature of work conditions in the manufacturing plant, it is difficult to obtain accurate information on process processing time and energy consumption, affecting the implementation of scheduling solutions. The fuzzy flexible job shop scheduling problem with uncertain production parameters has not yet been well studied. In this paper, a scheduling optimization model with the objectives of maximum completion time, production cost and delivery satisfaction loss is developed using fuzzy triangular numbers to characterize the time parameters, and an improved quantum particle swarm algorithm is proposed to solve it. The innovations of this paper lie in designing a neighborhood search strategy based on machine code variation for deep search; using cross-maintaining the diversity of elite individuals, and combining it with a simulated annealing strategy for local search. Based on giving full play to the global search capability of the quantum particle swarm algorithm, the comprehensive search capability of the algorithm is enhanced by improving the average optimal position of particles. In addition, a gray target decision model is introduced to make the optimal decision on the scheduling scheme by comprehensively considering the fuzzy production cost. Finally, simulation experiments are conducted for test and engineering cases and compared with various advanced algorithms. The experimental results show that the proposed algorithm significantly outperforms the compared ones regarding convergence speed and precision in optimal-searching. The method provides a more reliable solution to the problem and has some application value. [ABSTRACT FROM AUTHOR]

In this paper, a new timing synchronization algorithm for the main synchronous signal (PSS) is proposed for the risk identification of cross-border e-commerce in the Internet of things, aiming at the problems of poor performance of anti frequency bias and high computational complexity of the improved PSS timing synchronization algorithm. Based on the piecewise correlation algorithm, the normalized frequency deviation of PSS sequence is preset. The segmented ones are pre stored at the terminal by using the conjugate symmetry of PSS sequence. The fast correlation of each segment correlation window is realized by combining convolution and overlapping reservation block method. Then, the threshold judgment is made after the time delay accumulation of the correlation values of the segments is made, so as to complete the joint detection of timing synchronization and coarse frequency deviation. The simulation results show that the algorithm can improve the performance of the system anti frequency offset effectively, reduce the complexity of the calculation and show that the timing synchronization conditions of the Internet can be satisfied. At the same time, under the background of the current development of cross-border logistics, this paper reviews the current research status of Transnational E-commerce logistics and Transnational E-commerce logistics risk. By comparing the advantages and disadvantages of various risk assessment methods, neural network and genetic algorithm are selected as the basic risk assessment methods in this paper. Based on the improved PSS timing synchronization algorithm and the Internet of things, the risk indicators of e-commerce logistics transnational will be selected from five risk dimensions: platform risk, customs clearance risk, organizational risk, process risk and environmental risk. Through the comprehensive literature and expert's opinion, the logistics risk assessment index system of cross-border e-commerce is established. [ABSTRACT FROM AUTHOR]

The key step in the intelligence of tongue diagnosis is the segmentation of the tongue image, and the accuracy of the segmented edges has a significant impact on the subsequent medical judgment. Deep learning can predict the class of pixel points to achieve pixel-level segmentation of images, so it can be used to handle tongue segmentation tasks. However, different models have different segmentation effects, and they did not learn the connection between space and channels, resulting in inaccurate tongue segmentation. This paper first discussed the choice of model and loss function and then compared the results of different options to find the better model. Associating the red feature of the tongue is very conducive to segmentation as a feature, this paper tested many methods to try to get the color features of the original image to be paid attention to. Finally, this paper proposed an improved Encoder-Decoder network model to solve the problem based on the results. Start with Resnet as the backbone network, then introduce the U-Net model, and then we fused the attention layer, obtained from the source image through convolution and CBAM attention mechanism, and the feature layer obtained from the last upsampling in U-Net. Experimental results show that: The new, improved algorithm results are 2-3 percentage points higher than the popular algorithm, making it more suitable for tongue segmentation tasks. [ABSTRACT FROM AUTHOR]

Among the indoor localization algorithms, the algorithm based on traditional Back Propagation Neural Network (BPNN) has the problems of slow convergence and easy to fall into local optimum. It is difficult to apply the algorithm in noisy environments. Therefore, in this paper, we propose a novel indoor localization algorithm where the whole localization process is divided into two parts: data preprocessing and localization output. Data preprocessing means using filtering algorithm to process the Received Signal Strength Indication (RSSI) sequence. It is considered that the initial value of the received sequence has a significant impact on the performance of Kalman Filter (KF). An improved Kalman Filtering algorithm (DBSCAN-KF) is proposed based on the Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm. First, the RSSI values that are seriously disturbed by noise in the sequence are removed using the DBSCAN algorithm, and then the RSSI sequences are processed using KF so that the RSSI values can be closer to the theoretical values. The localization output part is to reduce the localization error caused by the BPNN. In this paper, the Differential Evolution (DE) algorithm and Particle Swarm Optimization (PSO) algorithm are combined, and the Differential Evolution Particle Swarm Optimization (DE-PSO) algorithm is proposed. The BPNN weights and thresholds are optimized in parallel, which improves the speed and ability of global optimization search and further avoids the shortcomings of traditional BPNNs that are prone to fall into local optimization in the training process. Experimental results show that the BPNN localization algorithm based on DBSCAN-KF improves the average localization accuracy by 0.26m compared with the BPNN localization algorithm without filtering. After filtering, the localization algorithm based on DE-PSO improved BPNN (DE-PSO-BP) improves the average localization accuracy by about 24% compared with the localization algorithm based on DE-PSO-BP. The localization algorithm based on DE-PSO-BP improves the average localization accuracy by about 61% compared with the traditional BPNN. [ABSTRACT FROM AUTHOR]

Designers refer to existing product cases and innovate products to develop new products. However, when designers screen product cases, there is no user participation, which leads to the lack of user-side knowledge and emotional drive that is very important for design. Therefore, it is necessary to play the role of user emotional knowledge in promoting the whole design process. This paper proposes the concept of the positive perceptual sample, which applies the knowledge emotion integration of designers and users to the screening sample case stage at the beginning of the design process. This study is based on the lack of user-side knowledge and emotional drive of reference cases and integrates user emotion into the reference case screening process. Then, in the emotion measurement process, users' cognitive data in the screening process are obtained through the eye-brain fusion cognitive experiment. Finally, the XGBoost algorithm is used to process feature index data to realize the classification and recognition of cognitive data and applied to the positive perceptual classification of products. The results show that the classification accuracy of physiological cognitive data with user emotional representation by the XGBoost algorithm is 90.87%. The results of cognitive data classification are applied to the screening of positive perceptual samples, and the satisfaction rate is 98.35%. The results show that the method proposed in this paper provides a new source of ideas for obtaining positive perceptual samples and can be applied to new product development. [ABSTRACT FROM AUTHOR]

In this paper, we propose two novel Alternating Direction Method of Multipliers (ADMM) algorithms for the sparse portfolio problem via sorted ℓ1-norm penalization (SLOPE). The first algorithm (FADMM) is presented by adding a prediction-correction step to the classic ADMM framework. Since the problem is not strongly convex, the second fast ADMM (FADMMR) is proposed by utilizing both prediction-correction step and restarting rules. Numerical experiments show that the FADMMR algorithm converges faster than the FADMM algorithm and ADMM algorithm when tuning parameters are relatively small. On the other hand, when tuning parameters are relative large, the FADMM algorithm performs better than the FADMMR algorithm and ADMM algorithm. The FADMM algorithm and FADMMR algorithm converge faster than the ADMM algorithm in terms of convergence time for different sizes of tuning parameters. For large-scale portfolio problem, the proposed algorithms have highly performance as well. Finally, empirical analysis on five datasets of stocks index show that the proposed algorithms are efficient and superior for solving sparse portfolio problems via SLOPE. [ABSTRACT FROM AUTHOR]

Metaheuristics are widely used in science and industry because it as a high-level heuristic technique can provide robust or advanced solutions compared to classical search algorithms. Flow Regime Algorithm is a novel physics-based optimization approach recently proposed, and it is one of the candidate algorithms for solving complex optimization problems because of its few parameter configurations, simple coding, and good performance. However, the population that initialized randomly may have poor diversity issues, resulting in insufficient global search, and premature convergence to local optimum. To solve this problem, in this paper, a novel enhanced Flow Regime Algorithm based on opposition learning scheme is proposed. The proposed algorithm introduces the opposition-based learning strategy into the generation of some populations to enhance the global search performance while maintaining a fast convergence rate. In order to verify the performance of the proposed algorithm, 23 benchmark numerical optimization functions were studied experimentally in detail and compared with six well-known algorithms. Experimental results show that the proposed algorithm outperforms all other metaheuristic algorithms in all unimodal functions with higher accuracy, and can obtain competitive results on more multimodal cases. A statistical comparison shows that the proposed algorithm has superiority. Finally, that the proposed algorithm can achieve higher quality alignment compared to most other metaheuristic-based systems and OAEI ontology alignment systems. [ABSTRACT FROM AUTHOR]

Decentralised fog computing can provide real-time interaction, minimize latency, heterogeneity, and provide networking services between edge devices and cloud data centers. One of the biggest challenges in the fog layer network is finding a trustworthy fog node. Trust management encompasses the process of being trustworthy and the act of assessing the reliability of other nodes. It is essential to carry out a comprehensive review using a systematic approach in this field to advance our understanding, address emerging challenges, and foster secure and efficient trust management practices. This research paper considers a comprehensive analysis of high-quality fog computing trust management literature from 2018 to 2022. A variety of distinct approaches have been chosen by fog computing-based trust management and these techniques are classified into three categories: algorithms, challenges, and limitations. Further, it reviews the various trust attacks in fog environments, details the solutions proposed in the current literature, and concludes with a discussion of the open challenges and potential future research directions in fog computing. [ABSTRACT FROM AUTHOR]

With the acceleration of urbanization, the frequency of building fire incidents has been increasing year by year. Therefore, rapid, efficient, and safe evacuation from buildings has become an urgent and important task. A construction fire escape path planning method based on an improved NavMesh algorithm is proposed in this paper. Firstly, by using the method of local updates in the navigation grid, redundant computation is reduced, and the update time of the improved algorithm is about 6.8% of that of the original algorithm, immediate generation of navigation is achieved. Secondly, the heuristic function of the pathfinding algorithm is improved, and a multi-exit path planning mechanism is proposed to achieve more efficient, which can quickly plan a safe evacuation path away from the spreading fire and smoke in the event of a fire. Finally, a new evaluation index called Navigation Grid Complexity (NGC) is proposed and demonstrated to measure the quality of navigation grids. The feasibility and effectiveness of the proposed method are validated through simulation experiments on actual building models, which can provide real-time, efficient, intelligent, and safe path planning for rapid evacuation of evacuees in the fire scene. [ABSTRACT FROM AUTHOR]

The purpose of clustering is to identify distributions and patterns within unlabelled datasets. Since the proposal of the original synchronization clustering (SynC) algorithm in 2010, synchronization clustering has become a significant research direction. This paper proposes a shrinking synchronization clustering (SSynC) algorithm utilizing a linear weighted Vicsek model. SSynC algorithm is developed from SynC algorithm and a more effective synchronization clustering (ESynC) algorithm. Through analysis and comparison, we find that SSynC algorithm demonstrates superior synchronization effect compared to SynC algorithm, which is based on an extensive Kuramoto model. Additionally, it exhibits similar effect to ESynC algorithm, based on a linear version of Vicsek model. In the simulations, a comparison is conducted between several synchronization clustering algorithms and classical clustering algorithms. Through experiments using some artificial datasets, eight real datasets and three picture datasets, we observe that compared to SynC algorithm, SSynC algorithm not only achieves a better local synchronization effect but also requires fewer iterations and incurs lower time costs. Furthermore, when compared to ESynC algorithm, SSynC algorithm obtains reduced time costs while achieving nearly the same local synchronization effect and the same number of iterations. Extensive comparison experiments with some class clustering algorithms demonstrate the effectiveness of SSynC algorithm. [ABSTRACT FROM AUTHOR]

The quality of sleep plays a crucial role in physical well-being, and individuals are becoming increasingly concerned about sleep quality and its associated health issues. Although various sleep monitoring devices exist, there remains a need for a highly accurate sleep state identification algorithm. To address this, we present a paper that utilizes machine learning techniques to identify human sleep states based on electroencephalogram (EEG) signals collected by an EEG instrument. We propose a model that incorporates two nonlinear characteristic parameters, MSE and PSE, extracted from artificially designed EEG signals as input. Additionally, we employ a Support Vector Machine (SVM) classifier algorithm to accurately identify sleep states, eliminating uncertainties associated with manually designed feature parameters. Experimental results demonstrate the superior accuracy of our proposed model for sleep state analysis, offering valuable insights for improving sleep quality and addressing related health concerns. [ABSTRACT FROM AUTHOR]

There is a widespread use of cluster-based routing in wireless sensor networks since it is the most energy-efficient. Idealizing cluster heads, on the other hand, is NP-hard and hence requires heuristic or metaheuristic approaches. However, while outperforming algorithms, metaheuristics computation time restricts its ability to respond to routing requests as rapidly as algorithms can today. A network's or an application's parameters can't be easily accommodated by routing methods. This paper offers the HMML, a combination model combining hybrid metaheuristics and machine-learning. Our HMML model makes use of an automated tuning metaheuristic (e.g. evolutionary algorithm) to fine-tune the heuristic technique for each specific configuration. For a variety of combinations, this is done. A network simulation is run using the modified heuristic algorithm in each configuration to arrive at a solution. As a result, a comprehensive dataset for a variety of conditions is produced (e.g., support vector machine). These characteristics include local (round-state), global (network-state), and application-specific aspects of the input feature vector. After training, the HMML model may be used to quickly cluster data. Machine learning's capacity to generalize helps us comprehend the metaheuristic algorithm's behavior in identifying optimal paths for previous configurations. Simulation studies show that HMML can adapt to varied applications while extending network life which increases upto 5% for total energy consumption. [ABSTRACT FROM AUTHOR]

Data clustering is a machine learning method for unsupervised learning that is popular in the two areas of data analysis and data mining. The objective is to partition a given dataset into distinct clusters, aiming to maximize the similarity among data objects within the same cluster. In this paper, an improved honey badger algorithm called DELHBA is proposed to solve the clustering problem. In DELHBA, to boost the population's diversity and the performance of global search, the differential evolution method is incorporated into algorithm's initial step. Secondly, the equilibrium pooling technique is included to assist the standard honey badger algorithm (HBA) break free of the local optimum. Finally, the updated honey badger population individuals are updated with Levy flight strategy to produce more potential solutions. Ten famous benchmark test datasets are utilized to evaluate the efficiency of the DELHBA algorithm and to contrast it with twelve of the current most used swarm intelligence algorithms and k-means. Additionally, DELHBA algorithm's performance is assessed using the Wilcoxon rank sum test and Friedman's test. The experimental results show that DELHBA has better clustering accuracy, convergence speed and stability compared with other algorithms, demonstrating its superiority in solving clustering problems. [ABSTRACT FROM AUTHOR]

Recent research emphasized the utilization of rechargeable wireless sensor networks (RWSNs) in a variety of cutting-edge fields like drones, unmanned aerial vehicle (UAV), healthcare, and defense. Previous studies have shown mobile data collection and mobile charging should be separately. In our paper, we created an novel algorithm for mobile data collection and mobile charging (MDCMC) that can collect data as well as achieves higher charging efficiency rate based upon reinforcement learning in RWSN. In first phase of algorithm, reinforcement learning technique used to create clusters among sensor nodes, whereas, in second phase of algorithm, mobile van is used to visit cluster heads to collect data along with mobile charging. The path of mobile van is based upon the request received from cluster heads. Lastly, we made the comparison of our proposed new MDCMC algorithm with the well-known existing algorithms RLLO [32] & RL-CRC [33]. Finally, we found that, the proposed algorithm (MDCMC) is effectively better collecting data as well as charging cluster heads. [ABSTRACT FROM AUTHOR]

In the control system of a lithium battery rolling mill, the correction system was crucial. This was because the correction system had a significant impact on the performance of the lithium battery rolling mill, including high precision and efficient rolling quality. However, the non-linearity of the correction system and the uncertainty of the correction system made it a challenging problem to achieve a high precision correction control. The contribution and innovation of this paper was a genetic fuzzy PID control strategy based on Kalman filter, which was proposed and applied to the control of lithium battery rolling mill correction technology. In order to achieve intelligent control of a high-precision electrode rolling mill correction system, an algorithm fusion control scheme was proposed. Firstly, a novel and detailed correction system model was presented. Next, the initial PID parameters of the correction were optimized by means of a genetic algorithm so that the PID parameters could be adapted to the correction control process and then optimized again by adding an extended Kalman filter. Finally, the lithium battery rolling mill correction control system was validated, tested and commissioned in the field. The results showed that the designed algorithm could meet the working requirements of the lithium battery rolling mill and that it improved the accuracy of the correction system. In the actual lithium battery rolling mill production process, the algorithm was compared with a conventional PID. Compared with the common single algorithm, the fusion algorithm proposed in this paper was a complete set of high precision correction control system algorithm to solve the high precision problem faced by the correction system in the actual lithium battery rolling mill correction system. [ABSTRACT FROM AUTHOR]

Image dehazing is a revolutionary technique for restoring images with hazy or foggy landscapes, that has gotten a lot of focus in recent years since it gained importance in a surveillance system. However, the image processing by the traditional defogging algorithm has difficulties in integrating the depth of image detail and the color of the image. Therefore, in this paper, a novel framework based on wavelet decomposition and optimized gamma correction is proposed for efficaciously retrieving the fog-free image. The foggy image is first divided into low and high frequency sub-images using SWT (Stationary Wavelet Transform), which has the advantages of preserving temporal features so that information loss can be stopped. Then the low frequency and high frequency images are processed with defogging and denoising modules to remove fog and noise respectively. The DOGC (Dragonfly optimal Gamma Correction) algorithm in dehazing module dynamically enhanced the color detail information without human intervention so that observed scene contrast and visibility are well preserved. Lastly, fog-free image is reconstructed from sub-enhanced images. The experimental findings show that the proposed framework outperforms state-of-the-art methods in terms of both quantitative and qualitative assessment criteria using the established dataset. Furthermore, the proposed method efficiently removes fog while preserving the naturalness of fog images. [ABSTRACT FROM AUTHOR]

Reducing the dimensions of the original data set while preserving the information as much as possible is conducive to improving the accuracy and efficiency of the model. To achieve this, this paper presents a multi-strategy African vulture optimization algorithm that is the chaotic and elite opposition-based African vulture optimization with the simplex method and differential evolution strategy(CESDAVO). Three main improvements are introduced into African vultures optimization(AVO) to improve its capabilities in this study. Firstly, the chaotic elite opposition-based learning strategy is used to initialize and diversify individual positions of vultures. Secondly, the simplex method is used to optimize those poor individuals so as to further improve the local exploitation ability of the algorithm. Thirdly, the differential evolution strategy is used to make the algorithm escape from the local optimum and improve the global optimization capability of the algorithm. The results of the ablation experiments show that mixing the three strategies greatly improves the optimization performance of the algorithm. In addition, Nine algorithms are compared with CESDAVO on 15 benchmark functions, and this experimental result shows that its optimization capability is superior to the others. Then, the proposed CESDAVO is employed for feature selection, and 12 standard datasets are used for experiments. According to the experimental results, CESDAVO obtained the highest average classification accuracy on 11 datasets and the highest feature selection rate on 8 datasets, which is significantly better than other algorithms. Finally, CESDAVO is also applied to feature reduction for essays, removing 24 features and significantly improving the classification accuracy on multiple classifiers. [ABSTRACT FROM AUTHOR]

Accurate and reliable prediction of PM2.5 concentrations is the basis for appropriate warning measures, and a single prediction model is often ineffective. In this paper, we propose a novel decomposition-and-ensemble model to predict the concentration of PM2.5. The model utilizes Ensemble Empirical Mode Decomposition (EEMD) to decompose PM2.5 series, Support Vector Regression (SVR) to predict each Intrinsic Mode Function (IMF), and a hybrid algorithm based on Differential Evolution (DE) and Grey Wolf Optimizer (GWO) to optimize SVR parameters. The proposed prediction model EEMD-SVR-DEGWO is employed to forecast the concentration of PM2.5 in Guangzhou, Wuhan, and Chongqing of China. Compared with six prediction models, the proposed EEMD-SVR-DEGWO is a reliable predictor and has achieved competitive results. [ABSTRACT FROM AUTHOR]

The expansive growth of information on the Internet has led to new developments in computer vision technology and image processing techniques. Since stone inscriptions are subject to erosion and polishing by the external environment for years, it is difficult to extract image and text information. In this study, the fuzzy control theory is combined with edge detection technology for image edge detection. Firstly, a suitable fuzzy rule and affiliation function are set, then a fuzzy control system is used to extract and detect the image edge information, and then a fuzzy logic rule-based edge detection algorithm is proposed to detect the inscription images. To test the performance of the algorithm, the detection effect of the image is first analyzed from a subjective perspective. The experimental results show that the proposed algorithm has better edge detection for both inscription and lena images, with better noise suppression without excessive distortion, and clearer inscription images. The proposed algorithm has the lowest MSE value of 41.26 when the detection object is the lena image b, and the highest PSNR value of 33.84 when the detection object is the lena image a. The proposed algorithm has the lowest MSE value of 41.26 when the detection object is the lena image b, and the highest PSNR value of 41.26 when the detection object is the lena image b. The proposed algorithm has the highest PSNR value of 33.84 when the detection object is the lena image b. In summary, the analysis of both subjective and objective indicators shows that the inscription image processing algorithm used in this paper has better processing effect, and the processed images become clearer with less distortion, which is helpful for both inscription image and text extraction. [ABSTRACT FROM AUTHOR]

The traditional negative selection algorithm with a randomly generated hypersphere detector is unable to satisfy the development needs of continuous learning due to the inherent defects of the detector. This paper proposes a novel negative selection algorithm for hyper-rectangle detectors that overcomes the shortcomings of randomly generated hyper-sphere detectors and lays the foundation for a negative selection algorithm with continuous learning capability. It uses self-sample clusters of equal-sized hypercubes instead of self-samples for training. The hyper-rectangle detectors are generated by cutting the nonself-space along the boundary of the self-sample clusters. The state space is covered without overlapping each other by self-sample clusters and detectors. The anomaly detection performance of the proposed method was demonstrated using Iris data, vowel recognition data (Vowel), and Wisconsin Breast Cancer (BCW) data. The experimental results show that the proposed method outperforms other artificial immune algorithms and clustering algorithms under the same parameter conditions. [ABSTRACT FROM AUTHOR]

The problem of mixed static and dynamic obstacle avoidance is essential for path planning in highly dynamic environments. However, the paths formed by grid edges can be longer than the actual shortest paths in the terrain since their headings are artificially constrained. Existing methods can hardly deal with dynamic obstacles. To address this problem, we propose a new algorithm combining Model Predictive Control (MPC) with Deep Deterministic Policy Gradient (DDPG). Firstly, we apply the MPC algorithm to predict the trajectory of dynamic obstacles. Secondly, the DDPG with continuous action space is designed to provide learning and autonomous decision-making capability for robots. Finally, we introduce the idea of the Artificial Potential Field to set the reward function to improve convergence speed and accuracy. In this paper, Matplotlib is used for simulation experiments. The results show that our method has improved considerably in accuracy by 8.11% -43.20% compared with theother methods, and on the length of the path and turning angle by reducing about 50 units and 340 degrees compared with DeepQ Network (DQN), respectively. We also employ Unity 3D to perform simulation experiments in highly uncertain environments, such as squares. [ABSTRACT FROM AUTHOR]

This paper aims to improve the accuracy of software defect prediction by using a prediction model based on grey incidence analysis and Naive Bayes algorithm. The model employs the Naïve Bayes as the basic classifier of the software defect prediction model. The grey incidence analysis is used to analyze the relation between software modules and ideal modules. Then, the grey correlation degree is embedded into the Naive Bayes classification model as a feature attribute. According to the comparison and analysis of NASA's public dataset, the prediction model in this paper improves the prediction accuracy. [ABSTRACT FROM AUTHOR]

WCSN is one of the most significant research areas in the terrestrial networking field due to its wide range of applications. One of the most difficult challenges is expanding the overall running time without attaching any new batteries or hardware. Using a novel EDT (Energy, Distance, Time) driven strategy, this paper proposes a clustering algorithm to solve the problems of the hotspot as well as reduce battery energy loss. The CH rotation method was then described in detail. This paper will introduce a new function called SCH (Substitute cluster head), which has replaced CH. The main aim of this research is to improve energy reliability and network lifetime. Finally, the presented EDT approach can be comparable to current algorithms, where MFSTERP's network lifetime is 15.4%, EECHS's is 23.2%, and ABC-DE's is 11.4%, but our proposed EDT methodology extends network lifetime by 40% as well as decreases energy usage by 7% as compared to LEACH when determining the SCH. [ABSTRACT FROM AUTHOR]

In the modern industrial process, a complete production process is achieved by requiring a variety of equipment to cooperate with each other. The abnormality in any equipment will have a large or small impact on process safety or product quality, resulting in increased risk. In recent years, many data-driven early-warning methods have been developed in academia. However, most of the methods need to be implemented on the support of normal and fault data. In order to overcome the problem, this paper establishes a new early-warning model based on negative selection algorithm (NSA) for centrifugal compressor unit without fault data. Firstly, a nearest neighbor fixed boundary negative selection algorithm (NFB-NSA) is proposed by optimizing detector generation mechanism and matching rules for test samples. Secondly, the performance of NFB-NSA is tested by Iris dataset. The experimental results among NFB-NSA, V-detector, and other anomaly detection methods for Iris dataset shows that NFB-NSA can achieve the highest detection accuracy and the lowest false alarm rate in most cases. Finally, the early-warning of centrifugal compressor unit under normal samples is carried on by NFB-NSA in this paper. Validated by field data, NFB-NSA is demonstrated to be of excellent accuracy and robustness by results of experiments. Moreover, the influence of size of training sample on performance of NFB-NSA is obtained. [ABSTRACT FROM AUTHOR]

The substitutability between products or the intensity of market competition is the key parameter affecting the supplier's pricing decision. However, the parameter cannot be accurately measured in real life. This paper provides a method based on prior information to solve this issue. First, compared to classical concept lattice theory, the interval concept lattice theory can deal with uncertain information more accurately. It is used to extract the objects within the interval parameters [α, β], and then interval concepts and lattice structure are built. Second, based on the interval concepts and lattice structure, the association rule mining algorithm is designed to further extract the association rules under different interval parameters. Third, to obtain the effective association degree between two objects, the rule optimization algorithm is put forward by comparing the update of rules. Finally, the association degree can indirectly reflect the substitutability between products. Then the price of a new product can be determined. Our paper provides some implication on pricing for suppliers in competitive supply chain. [ABSTRACT FROM AUTHOR]

Slime mould algorithm (SMA) is a novel meta-heuristic algorithm with fast convergence speed and high convergence accuracy. However, it still has some drawbacks to be improved. The exploration and exploitation of SMA is difficult to balance, and it easy to fall into local optimum in the late iteration. Aiming at the problems existing in SMA, a multistrategy slime mould algorithm named GCSMA is proposed for global optimization in this paper. First, the Logistic-Tent double chaotic map approach is introduced to improve the quality of the initial population. Second, a dynamic probability threshold based on Gompertz curve is designed to balance exploration and exploitation. Finally, the Cauchy mutation operator based on elite individuals is employed to enhance the global search ability, and avoid it falling into the local optimum. 12 benchmark function experiments show that GCSMA has superior performance in continuous optimization. Compared with the original SMA and other novel algorithms, the proposed GCSMA has better convergence accuracy and faster convergence speed. Then, a special encoding and decoding method is used to apply GCSMA to discrete flexible job-shop scheduling problem (FJSP). The simulation experiment is verified that GCSMA can be effectively applied to FJSP, and the optimization results are satisfactory. [ABSTRACT FROM AUTHOR]

Teaching quality is the foundation and lifeline of colleges and universities. To establish a distinctive university, we must adhere to the scientific concept of development, deepen teaching reform and improve teaching quality. The classroom teaching quality (CTQ) evaluation of college physical education (PE) is an essential part of the teaching process. Building a scientific, comprehensive, reasonable and effective evaluation system is crucial to improve the quality of college PE classroom teaching. This process is not easy and needs long-term efforts and persistence. The CTQ evaluation of college volleyball training is viewed as the multi-attribute decision-making (MADM). In this paper, we connect the geometric Heronian mean (GHM) operator and power geometric (PG) operator with 2-tuple linguistic neutrosophic sets (2TLNSs) to build the generalized 2-tuple linguistic neutrosophic numbers weighted power GHM (G2TLNWPGHM) operator. Then, the G2TLNWPGHM operator is used to tackle MADM with 2TLNSs. Finally, an example for CTQ evaluation of college volleyball training is used to show the proposed methods. [ABSTRACT FROM AUTHOR]

Multi-verse optimizer (MVO) is a novel nature-inspired algorithm that has been applied to solve many practical optimization problems. Nevertheless, the original MVO has problems of low convergence speed and accuracy of final solutions. Besides, the failure to strike a balance between exploration and exploitation and the easiness of falling into local optimum in the early stages makes MVO hard to converge. In this paper, we propose a novel hybrid algorithm called Hybrid Queuing Search algorithm with MVO (HQS-MVO) by introducing Queuing Search Algorithm (QSA) and Metropolis rule to overcome these shortcomings. The introduction of QSA is to improve the accuracy of final solutions. At the same time, the Metropolis rule is employed to prevent the algorithm from falling into the local optimum, thus improving the convergence speed of the original MVO. Then, we compare the performance of HQS-MVO on 30 benchmark functions of CEC2014 and 10 benchmark functions of CEC2019 with the other four related algorithms and three latest algorithms. The results show that HQS-MVO has the most accurate solutions in most cases compared with other seven algorithms in most cases, and gains the lowest standard deviations. Moreover, we make convergence curve of the eight algorithms. Compared with other algorithms, HQS-MVO shows outstanding performances and converge faster in general. Finally, we apply the proposed algorithm in a real engineering optimization problem and compare its performance with other algorithms, the results show that HQS-MVO is still the best one in problem of designing of gear train. [ABSTRACT FROM AUTHOR]

The traditional fuzzy C-means clustering technology only considers one performance Angle of image segmentation process when processing data, resulting in low accuracy of image segmentation. In this paper, the traditional FCM algorithm is analyzed, and the low clustering accuracy, noise interference and lack of flexibility and other problems are fully considered from the relationship between parameter components, non-local spatial information elements and noise sensitivity. Firstly, a distance calculation method based on robust statistics theory is proposed, which can deal with abnormal noise stably. Secondly, based on the extreme learning machine theory, the non-local spatial information coefficient is introduced to improve the identification ability of the influence factors. This method not only guarantees the anti-noise performance of the algorithm, but also preserves the image data, improving the iteration efficiency and segmentation accuracy of the algorithm. The test results show that the accuracy of the improved C-means clustering algorithm for image segmentation is 95.5%, which is compared with the traditional C-means clustering technique and other optimization algorithms. [ABSTRACT FROM AUTHOR]