Search

Mobile edge computing (MEC) is receiving more attention than centralized cloud computing due to the massive increase in transmission and compute requirements in 5G vehicle networks. It offers a significant amount of processing and storage resources to the edge of networks, offloading applications from vehicle terminals that are computation-intensive and delay-sensitive. For devices with limited resources, it uses edge resources to provide computationally heavy operations while conserving energy. This paper proposes a novel approach for computing offloading in MEC. To effectively optimize the MEC resources, this paper proposes a novel algorithm. First, the joint optimization and service cache decision subproblems were determined from continuous and discrete variables. Then, the near-optimal solution is determined from the subproblems through convex optimization and Karush–Kuhn–Tucker method. Simulation results show that the proposed algorithm has better computational offloading and resource allocation performance as compared to existing algorithms. [ABSTRACT FROM AUTHOR]

Stimuli from the road surface cause car vibrations. The suspension system ensures the vehicle's stability and smoothness when moving. In this research, the author introduces the use of active suspension with a hydraulic actuator to improve the comfort of cars. Car oscillations are described based on a quarter-dynamics model with five state variables. Besides, the nonlinear system's SM (sliding mode) control algorithm is used to control the system. The SM algorithm's parameters are optimally selected using the multiple loop algorithm. The multiple loop algorithm allows the values to vary within a predefined limit and provides an optimal parameter based on the vehicle's vibration conditions. This is a new point in the paper compared to previous studies. The output of the simulation problem includes displacements and accelerations of both the sprung and unsprung masses. In addition, the change of dynamics force at the wheel is also considered when evaluating the interaction between the wheel and the road surface. According to the paper's results, the vehicle body's acceleration and displacement values are strongly reduced when using the SM algorithm, compared with cars with only traditional suspension. In addition, the change in dynamics force at the wheel is not significant when using this algorithm. As a result, the car's smoothness has been improved while the vehicle's stability has not been lost. The phenomenon of "chattering" still occurs in some cases; however, its effect is negligible. [ABSTRACT FROM AUTHOR]

Sequential recommendation algorithm can predict the next action of a user by modeling the user's interaction sequence with an item. However, most sequential recommendation models only consider the absolute positions of items in the sequence, ignoring the time interval information between items, and cannot effectively mine user preference changes. In addition, existing models perform poorly on sparse data sets, which make a poor prediction effect for short sequences. To address the above problems, an improved sequential recommendation algorithm based on short-sequence enhancement and temporal self-attention mechanism is proposed in this paper. In the proposed algorithm, a backward prediction model is trained first, to predict the prior items in the user sequence. Then, the reverse prediction model is used to generate a batch of pseudo-historical items before the initial items of the short sequence, to achieve the goal of enhancing the short sequence. Finally, the absolute position information and time interval information of the user sequence are modeled, and a time-aware self-attention model is adopted to predict the user's next action and generate a recommendation list. Various experiments are conducted on two public data sets. The experimental results show that the method proposed in this paper has excellent performance on both dense and sparse data sets, and its effect is better than that of the state of the art. [ABSTRACT FROM AUTHOR]

Swarm intelligence algorithms are metaheuristics inspired by the collective behavior of species such as birds, fish, bees, and ants. They are used in many optimization problems due to their simplicity, flexibility, and scalability. These algorithms get the desired convergence during the search by balancing the exploration and exploitation processes. These metaheuristics have applications in various domains such as global optimization, bioinformatics, power engineering, networking, machine learning, image processing, and environmental applications. This paper presents a systematic literature review (SLR) on applications of four swarm intelligence algorithms i.e., grey wolf optimization (GWO), whale optimization algorithms (WOA), Harris hawks optimizer (HHO), and moth-flame optimizer (MFO) in the field of software engineering. It presents an in-depth study of these metaheuristics' adoption in the field of software engineering. This SLR is mainly comprised of three phases such as planning, conducting, and reporting. This study covers all related studies published from 2014 up to 2022. The study shows that applications of the selected metaheuristics have been utilized in various fields of software engineering especially software testing, software defect prediction, and software reliability. The study also points out some of the areas where applications of these swarm intelligence algorithms can be utilized. This study may act as a guideline for researchers in improving the current state-of-the-art on generally adopting these metaheuristics in software engineering. [ABSTRACT FROM AUTHOR]

In the Internet age, information security is threatened anytime and anywhere and the copyright protection of audio and video as well as the need for matching detection is increasingly strong. In view of this need, this paper proposes a zero-watermarking algorithm for audio and video matching based on NSCT. The algorithm uses NSCT, DCT, SVD, and Schur decomposition to extract video features and audio features and generates zero-watermark stream through synthesis, which is stored in a third-party organization for detection and identification. The detection algorithm can obtain zero watermark from the audio and video to be tested and judge and locate tampering by comparing with the zero watermark of the third party. From the experimental results, this algorithm can not only detect whether the audio and video are mismatched due to tampering attacks but also locate the mismatched audio and video segments and protect the copyright. [ABSTRACT FROM AUTHOR]

Evaluating scientific articles has always been a challenging task, made even more difficult by the constantly evolving citation networks. Despite numerous attempts at solving this problem, most existing approaches fail to consider the link relationships within the citation network, which can often result in biased evaluation results. To overcome this limitation, we present an optimization ranking algorithm that leverages the P-Rank algorithm and weighted citation networks to provide a more accurate article ranking. The proposed approach employs two hyperbolic tangent functions to calculate the corresponding age of articles and the number of citations, while also updating the link relationships of each paper node in the citation network. We validate the effectiveness of the proposed approach using three evaluation indicators and conduct experiments on three public datasets. The obtained experimental results demonstrate that the optimization article ranking method can achieve competitive performance when compared to other unweighted ranking algorithms. In addition, we note that the optimal Spearman's rank correlation and robustness can all be achieved by using a combination of the following parameters: α = 10 , β = 5 , and γ = 2. [ABSTRACT FROM AUTHOR]

With the rapid development of information age, various social groups and corresponding institutions are producing a large amount of information data every day. For such huge data storage and identification, in order to manage such data more efficiently and reasonably, traditional semantic similarity algorithm emerges. However, the accuracy of the traditional semantic similarity algorithm is relatively low, and the convergence of corresponding algorithm is poor. Based on this problem, this paper starts with the conceptual structure of language, analyzes the depth of language structure and the distance between nodes, and analyzes the two levels as the starting point. For the information of a specific data resource description frame type, the weight of interconnected edges is used for impact analysis so as to realize the semantic similarity impact analysis of all information data. Based on the above improvements, this paper also systematically establishes the data information modeling process based on language conceptual structure and establishes the corresponding model. In the experimental part, the improved algorithm is simulated and analyzed. The simulation results show that compared with the traditional algorithm, the algorithm has obvious accuracy improvement. [ABSTRACT FROM AUTHOR]

This paper introduces a novel method to control the operation of the active suspension system. In this research, a quarter-dynamic model is used to simulate the vehicle's vibrations. Besides, the sliding mode-PID-integrated algorithm with five state variables is proposed to be used. This is a completely original and novel algorithm. The process of establishing the control algorithm is clearly described. The simulation is performed by the MATLAB software. The results of the paper have shown the advantages of the sliding mode-PID algorithm used in this research. Accordingly, the displacement and acceleration of the sprung mass were significantly reduced when this algorithm was used. The maximum and average values of the displacement of the sprung mass are only 1.31% and 1.29%, respectively, compared with the situation of the vehicle using a passive suspension. Similarly, the value of the acceleration is 6.98% and 2.94%, respectively. In addition, the phenomenon of "chattering" has also been significantly reduced when using this controller. In the future, some more complex algorithms can be proposed. [ABSTRACT FROM AUTHOR]

In this paper, a new human resource scheduling algorithm is proposed based on the optimization simulation of the human resource scheduling algorithm to find the most suitable human resource allocation scheme for different regions. A simulation system for human resource allocation is proposed, which integrates the scheduling algorithm of this paper and conducts simulation experiments using the historical data of enterprise problems in each region collected in a smart city. The simulation experiment proves that the dispatching algorithm in this paper is more reasonable than the current dispatching algorithm, and the relationship between enterprise problems and the number of employees is also found, and finally, the simulation system in this paper is proved to be stable through large-scale simulation experiment. [ABSTRACT FROM AUTHOR]

In this paper, the most common pepper noise in grayscale image noise is investigated in depth in the median filtering algorithm, and the improved median filtering algorithm, adaptive switching median filtering algorithm, and adaptive polar median filtering algorithm are applied to the OTSU algorithm. Two improved OTSU algorithms such as the adaptive switched median filter-based OTSU algorithm and the polar adaptive median filter-based OTSU algorithm are obtained. The experimental results show that the algorithm can better cope with grayscale images contaminated by pretzel noise, and the segmented grayscale images are not only clear but also can better retain the detailed features of grayscale images. A genetic algorithm is a kind of search algorithm with high adaptive, fast operation speed, and good global space finding ability, and it will have a good effect when applied to the threshold finding of the OTSU algorithm. However, the traditional genetic algorithm will fall into the local optimal solution in different degrees when finding the optimal threshold. The advantages of the two interpolation methods proposed in this paper are that one is the edge grayscale image interpolation algorithm using OTSU threshold adaptive segmentation and the other is the edge grayscale image interpolation algorithm using local adaptive threshold segmentation, which can accurately divide the grayscale image region according to the characteristics of different grayscale images and effectively improve the loss of grayscale image edge detail information and jagged blur caused by the classical interpolation algorithm. The visual effect of grayscale images is enhanced by selecting grayscale images from the standard grayscale image test set and interpolating them with bilinear interpolation, bucolic interpolation, NEDI interpolation, and FEOI interpolation for interpolation simulation validation. The subjective evaluation and objective evaluation, as well as the running time, are compared, respectively, showing that the method of this paper can effectively improve the quality of grayscale image interpolation. [ABSTRACT FROM AUTHOR]

This paper investigates the control problem of the buoyancy regulation system for autonomous underwater vehicle (AUV). There are some problems to be considered in the oil-water conversion-based buoyancy regulation system, including the external seawater pressure, the pressure fluctuations, and the slow switching speed of the ball valve. The control accuracy of the buoyancy regulation under the traditional PID controller cannot meet the requirements of the project. In this paper, a fuzzy sliding mode control scheme is developed for the buoyancy regulation system to solve the abovementioned problems. At first, a mathematical model of the buoyancy regulation system is established, and the stability of the system is analyzed. Then, the sliding mode control algorithm is combined with the fuzzy system to improve the control accuracy. Finally, the pool-experiment results on a prototype show that the developed control scheme can meet the requirements of the control accuracy for the buoyancy regulation system. [ABSTRACT FROM AUTHOR]

The self-organizing model and expectation-maximization method are two traditional identification methods for switching models. They interactively update the parameters and model identities based on offline algorithms. In this paper, we propose a flexible recursive least squares algorithm which constructs the cost function based on two kinds of errors: the neighboring two-parameter estimation errors and the output estimation errors. Such an algorithm has several advantages over the two traditional identification algorithms: it (1) can estimate the parameters of all the sub-models without prior knowledge of the model identities; (2) has less computational efforts; and (3) can update the parameters with newly arrived data. The convergence properties and simulation examples are provided to illustrate the efficiency of the algorithm. [ABSTRACT FROM AUTHOR]

This paper proposes a hyperchaos-based image encryption algorithm, which consists of two scrambling-diffusion operations and one scrambling operation. In the proposed algorithm, the initial conditions of a hyperchaotic Chen system are first generated using the Message Digest 5 (MD5) value of digital images and given initial values, and then the images will be encrypted using the keystream created by the system. Since the initial values of hyperchaotic Chen systems are related to plaintext and the encryption process is related to the images, this algorithm is able to effectively protect images against selective plaintext attacks. Simulation results demonstrate that the present algorithm offers enhanced encryption performance, high security, and strong resistance to known attacks. Therefore, it may find wide application in image encryption transmission. Compared to other image encryption algorithms, the proposed algorithm uses different keystreams when encrypting different images and is capable of effectively resisting various plain image and differential attacks faster. [ABSTRACT FROM AUTHOR]

Aiming at the face photos of film and television animation, this paper proposes a new fast three-dimensional (3D) face modelling algorithm. First of all, based on the LBF algorithm, this paper proposes a multifeature selection idea to automatically detect multiple features of the face. Secondly, in order to solve the shortcomings of slow training speed while achieving large pose face alignment, the regression-based CNN is selected as the algorithm to achieve fast convergence. Then, due to the influence of various factors, the extracted feature points are not completely correct, and Gabor features are used to screen the matching of feature points. Finally, by analysing the principle of 3DMM 3D face reconstruction, a single-view 3D face reconstruction method based on CNN is proposed. The experimental results show that the algorithm in this paper has good reconstruction performance and real-time performance and can realize the rapid modelling of human face. [ABSTRACT FROM AUTHOR]

Faced with massive amounts of online news, it is often difficult for the public to quickly locate the news they are interested in. The personalized recommendation technology can dig out the user's interest points according to the user's behavior habits, thereby recommending the news that may be of interest to the user. In this paper, improvements are made to the data preprocessing stage and the nearest neighbor collection stage of the collaborative filtering algorithm. In the data preprocessing stage, the user-item rating matrix is filled to alleviate its sparsity. The label factor and time factor are introduced to make the constructed user preference model have a better expression effect. In the stage of finding the nearest neighbor set, the collaborative filtering algorithm is combined with the dichotomous K-means algorithm, the user cluster matching the target user is selected as the search range of the nearest neighbor set, and the similarity measurement formula is improved. In order to verify the effectiveness of the algorithm proposed in this paper, this paper selects a simulated data set to test the performance of the proposed algorithm in terms of the average absolute error of recommendation, recommendation accuracy, and recall rate and compares it with the user-based collaborative filtering recommendation algorithm. In the simulation data set, the algorithm in this paper is superior to the traditional algorithm in most users. The algorithm in this paper decomposes the sparse matrix to reduce the impact of data sparsity on the traditional recommendation algorithm, thereby improving the recommendation accuracy and recall rate of the recommendation algorithm and reducing the recommendation error. [ABSTRACT FROM AUTHOR]

In order to improve the effect of athlete's injury recognition and rehabilitation evaluation, this paper studies the traditional rehabilitation evaluation method and proposes a new athlete rehabilitation evaluation system combining the Internet of Health Things technology and human gait analysis algorithm. Moreover, this paper combines sports characteristics to improve the algorithm of human gait analysis. In addition, through the study of the athlete's human body modeling and movement process, a human gait analysis algorithm that can be applied to multiple sports is proposed, and the gait parameter analysis and algorithm reliability research are carried out through simulation analysis. After confirming that the algorithm is effective, this paper combines the Internet of Health Things technology to construct a system model, obtains the system function module architecture with the support of the Internet of Health Things technology, and conducts experiments to verify the system performance. From the experimental research, it can be seen that the model constructed in this paper meets the theoretical and practical needs, and the system in this paper can be applied to practice in the future. The human gait recognition algorithm constructed in this article has a good effect and can play an important role in sports rehabilitation of athletes. At the same time, the system constructed in this article has certain advantages over traditional sports rehabilitation systems with the support of algorithms. [ABSTRACT FROM AUTHOR]

In this paper, through the improved decision tree algorithm, the handles in multimedia English assistance are parsed and simulated. In order to better perceive the sense of language in English composition and improve the rationality of intelligent evaluation, an N element based on association analysis is proposed. Sense value quantification calculates its support in the corpus by obtaining N-tuples of the composition. If the degree of support is lower than the threshold, the part where the language sense problem occurs is analyzed, and the type of language sense problem is judged for the students to provide assistance in modifying the composition. In addition, this paper also extracts word features, sentence features, and text structure features in the composition to fit the English handles analytical score. By testing the test set, the experiment shows that, by extracting the language sense features of the candidate's English composition, it can not only judge whether there is a problem with the language sense of the candidate, but also provide a basis for the overall evaluation of the composition. [ABSTRACT FROM AUTHOR]

Order picking, which is collecting a set of products from different locations in a warehouse, has repeatedly been described as one of the most laborious and time-consuming internal logistic processes. Each order is issued to pick some products located at given locations in the warehouse. In this paper, we consider an order picking problem, in which a number of orders with different delivery due dates are going to be retrieved by a limited number of order pickers in multiperiods such that the total tardiness is minimized. The aim is to determine a retrieval plan in terms of order batching and order picker multitrip routing as decision variables. Besides, products are arrived and replenished at the predetermined locations at different periods. Therefore, products sitting in those locations should be delivered soon to provide empty rooms for replenishment. A mixed integer linear programming formulation is proposed for this new problem. The model is optimally solved for small-size problems. For larger instances, grouping metaheuristic algorithms are proposed based on particle swarm optimization and the league championship algorithm that use group-based operators to generate reasonable batches of orders. Improvement heuristics are designed as well. The performance of the MILP formulation and metaheuristic algorithms is analyzed for different problem instances whose designs are based on real data gathered from an auto parts warehouse. Results indicate that our algorithms can stably solve large instances of the problem in a reasonable time. [ABSTRACT FROM AUTHOR]

Automatic Generation Control (AGC) in modern power systems is getting complex, due to intermittency in the output power of multiple sources along with considerable digressions in the loads and system parameters. To address this problem, this paper proposes an approach to calculate Power System Restoration Indices (PSRI) of a 2-area thermal-hydro restructured power system. This study also highlights the necessary ancillary service requirements for the system under a deregulated environment to cater to large-scale power failures and entire system outages. An abrupt change in consumer load demands and disturbances in any control region (area) of a multiarea (interrelated) system causes severe fluctuations in frequency and interarea power exchanges. However, simple Proportional and Integral (PI) controllers are most prevalent in the literature to effectively resolve AGC issues, while its integral gain is smaller due to the larger overshoot in transient performance. Therefore, an attempt has been made with a novel control strategy, known as the pseudoderivative feedforward with feedback (PDFF) controller, is developed to keep the interarea power exchanges and the frequency to the specified limits after load changes. A PDFF controller is designed and implemented using the flower pollination algorithm (FPA) to obtain optimal dynamic performance for different types of potential power flows in a restructured power system under investigation. The proposed PDFF controller localizes the zero at an optimal place that reduces the rise time of the step-response to reduce the excessive overshoot and gives much better dynamic performances as compared to the PI control structure. The Integral Square Error (ISE) is considered as a performance criterion to derive the optimized gain of the PDFF control structure using FPA. Different PSRI are computed based on the transient response of the 2-area deregulated multisource system and different restoration measures to be taken are also discussed. The simulation results clearly show that the proposed approach is very powerful in decreasing the frequency and tie-power digressions under different load perturbations. [ABSTRACT FROM AUTHOR]

Based on the millimetre-wave time-domain channel detector, this paper conducts channel measurement and modelling for different scenarios and antenna types in typical frequency bands and thus carries out a study on the propagation characteristics of millimetre-wave channels in typical frequency bands and scenarios for 5G. The time-varying characteristics and modelling methods of millimetre-wave clusters are studied, and the time-varying channel simulation strategy and linear regression fitting method are used to establish the time-varying generation and extinction model of clusters by combining the measured data of 26 GHz large-scale antenna channels. The algorithm is based on the correlation dictionary and achieves the efficient and optimal selection of large-scale antenna arrays in the millimetre-wave band. A low-complexity multiuser hybrid precoding design scheme is proposed based on the wideband millimetre-wave large-scale Multiple-Input Multiple-Output (MIMO) system. The scheme aims to maximize the system spectral efficiency and introduces the net spectral efficiency as a bridge to decouple the analogy precoding design from the digital precoding design, thus significantly reducing the computational complexity. In the analogy precoding stage, a Hungarian algorithm-based beam assignment method is proposed to avoid beam conflicts and maximize the net spectral efficiency of the system; in the digital precoding stage, the equivalent channel matrix of each subcarrier is diagonalized to eliminate multiuser interference. Finally, the effectiveness of the scheme is verified by simulation. In this paper, we focus on the radio frequency (RF) link and user selection algorithm of 5G mobile communication system. Through the study of these two aspects, the RF link of our communication system has high stability and reliability, and through the study of the algorithm used for selection, our results also have a strong practical value. [ABSTRACT FROM AUTHOR]

Abnormal behavior detection of social security funds is a method to analyze large-scale data and find abnormal behavior. Although many methods based on spectral clustering have achieved many good results in the practical application of clustering, the research on the spectral clustering algorithm is still in the early stage of development. Many existing algorithms are very sensitive to clustering parameters, especially scale parameters, and need to manually input the number of clustering. Therefore, a density-sensitive similarity measure is introduced in this paper, which is obtained by introducing new parameters to transform the Gaussian function. Under this metric, the distance between data points belonging to different classes will be effectively amplified, while the distance between data points belonging to the same class will be reduced, and finally, the distribution of data will be effectively clustered. At the same time, the idea of Eigen gap is introduced into the spectral clustering algorithm, and the verified gap sequence is constructed on the basis of Laplace matrix, so as to solve the problem of the number of initial clustering. The strong global search ability of artificial bee colony algorithm is used to make up for the shortcoming of spectral clustering algorithm that is easy to fall into local optimal. The experimental results show that the adaptive spectral clustering algorithm can better identify the initial clustering center, perform more effective clustering, and detect abnormal behavior more accurately. [ABSTRACT FROM AUTHOR]

The original target tracking algorithm based on a single model has long been unable to meet the complex and changeable characteristics of the target, and then there are problems such as poor tracking accuracy, target loss, and model mismatch. The interactive multimodel algorithm uses multiple motion models to track the target, obtains the degree of adaptation between the actual motion state of the target and each model according to the calculated likelihood function, and then combines the updated weight values of each filter to obtain a weighted sum. Therefore, the interactive multimodel algorithm can achieve better performance. This paper proposes an improved interactive multimodel algorithm that can achieve player tracking and trajectory feature matching. First, this paper proposes an improved Kalman filtering (IKF) algorithm. This method is developed from the unbiased conversion measurement Kalman filter, which can obtain more accurate target state and covariance estimation. Secondly, using the parallel processing mode of the IMM algorithm to efficiently solve the data association between multiple filters, the IMM-IKF model is proposed. Finally, in order to solve the problem of low computational efficiency and high mismatch rate in image feature point matching, a method of introducing a minimum spanning tree in two-view matching is proposed. Experimental results show that the improved IMM-IKF algorithm can quickly respond to changes in the target state and can find the matching path with the lowest matching cost. In the case of ensuring the matching accuracy, the real-time performance of image matching is ensured. [ABSTRACT FROM AUTHOR]

This paper provides a detailed description of the recommendation system and collaborative filtering algorithm to optimize the English learning platform through the collaborative filtering algorithm and analyses the algorithmic principles and specific techniques of collaborative filtering. After introducing the recommendation system and collaborative filtering algorithm, this paper elaborates on the theoretical basis and technical principles of the recommendation algorithm based on cognitive ability and difficulty and provides an in-depth analysis of the design and implementation of the recommendation algorithm by combining cognitive diagnosis theory, readability formula, and English knowledge map, which provides a comprehensive and solid theoretical guidance and support for the application development of the online English learning platform. The system is tested by building a Spring Cloud platform, importing actual business data, focusing on the validation of the recommendation model, and connecting the recommendation system to the formal production system to analyse the recommendation effect. Compared with the original recommendation method, the online English learning platform designed and implemented in this paper based on the cognitive ability and difficulty collaborative filtering recommendation algorithm has a better recommendation effect. The system is proved to be well designed and has certain reference and guiding value for the whole web-based online learning platform and has a broader application prospect nowadays and in the future. [ABSTRACT FROM AUTHOR]

In this paper, a mathematical model for large deformation of a cantilever beam subjected to tip-concentrated load is presented. The model is governed by nonlinear differential equations. Large deformation of a cantilever beam has number of applications is structural engineering. Since finding an exact solution to such nonlinear models is difficult task, this paper focuses on developing soft computing technique based on artificial neural networks (ANNs), generalized normal distribution optimization (GNDO) algorithm, and sequential quadratic programming (SQP). The strength of ANN modeling for governing the equation of cantilever beam is exploited by the global search ability of GNDO and further explored by the local search mechanism of SQP. Design scheme is evaluated for different cases depending on variations in dimensionless end-point load ρ . Furthermore, to validate the effectiveness and convergence of algorithm proposed technique, the results of the differential transformation method (DTM) and exact solutions are compared. The statistical analysis of performance indicators in terms of mean, median, and standard deviations further establishes the worth of ANN-GNDO-SQP algorithm. [ABSTRACT FROM AUTHOR]

Microexpressions have extremely high due value in national security, public safety, medical, and other fields. However, microexpressions have characteristics that are obviously different from macroexpressions, such as short duration and weak changes, which greatly increase the difficulty of microexpression recognition work. In this paper, we propose a microexpression recognition method based on multimodal fusion through a comparative study of traditional microexpression recognition algorithms such as LBP algorithm and CNN and LSTM deep learning algorithms. The method couples the separate microexpression image information with the corresponding body temperature information to establish a multimodal fusion microexpression database. This paper firstly introduces how to build a multimodal fusion microexpression database in a laboratory environment, secondly compares the recognition accuracy of LBP, LSTM, and CNN + LSTM networks for microexpressions, and finally selects the superior CNN + LSTM network in the comparison results for model training and testing on the test set under separate microexpression database and multimodal fusion database. The experimental results show that a microexpression recognition method based on multimodal fusion designed in this paper is more accurate than unimodal recognition in multimodal recognition after feature fusion, and its recognition rate reaches 75.1%, which proves that the method is feasible and effective in improving microexpression recognition rate and has good practical value. [ABSTRACT FROM AUTHOR]

This paper introduces a job-shop scheduling problem (JSP) with bidirectional circular precedence constraints, called BCJSP. In the problem, each job can be started from any operation and continued by its remaining operations in a circular precedence-relation chain via either a clockwise or counterclockwise direction. To solve BCJSP, this paper proposes a multilevel metaheuristic consisting of top-, middle-, and bottom-level algorithms. The top- and middle-level algorithms are population-based metaheuristics, while the bottom-level algorithm is a local search algorithm. The top-level algorithm basically controls a start operation and an operation-precedence-relation direction of each job, so that BCJSP becomes a JSP instance that is a subproblem of BCJSP. Moreover, the top-level algorithm can also be used to control input parameters of the middle-level algorithm, as an optional extra function. The middle-level algorithm controls input parameters of the bottom-level algorithm, and the bottom-level algorithm then solves the BCJSP's subproblem. The middle-level algorithm evolves the bottom-level algorithm's parameter values by using feedback from the bottom-level algorithm. Likewise, the top-level algorithm evolves the start operations, the operation-precedence-relation directions, and the middle-level algorithm's parameter values by using feedback from the middle-level algorithm. Performance of two variants of the multilevel metaheuristic (i.e., with and without the mentioned extra function) was evaluated on BCJSP instances modified from well-known JSP instances. The variant with the extra function performs significantly better in number than the other. The existing JSP-solving algorithms can also solve BCJSP; however, their results on BCJSP are clearly worse than those of the two variants of the multilevel metaheuristic. [ABSTRACT FROM AUTHOR]

To facilitate the performance of the active suspension system, the optimization of a new reaching law of the active suspension sliding mode controller based on cuckoo algorithm is addressed in this paper. Firstly, a linear model of the active suspension system is built. Then, according to the features of the new exponential reaching law, an active sliding mode control scheme based on the new sliding mode reaching law is designed. Finally, the simulation results are separated into two stages to verify the suitability and superiority of the proposed control scenario. [ABSTRACT FROM AUTHOR]

Practical applications of microaerial vehicle face significant challenges including imprecise localization, limited on-board energy, and motion uncertainty. This paper focuses on the latter two issues. The core of proposed energy-optimal path planning algorithm is an energy consumption model deriving from real measurements of a specific quadrotor and utilizing a 2D Gaussian distribution function to simulate the uncertainty of random drift. Based on these two models, we formulate the optimal path traversing the 3D map with minimum energy consumption using a heuristic ant colony optimization. Multiple sets of contrast experiments demonstrate the effectiveness and efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we study the path based continuous spatial keyword queries, which find the answer set continuously when the query point moves on a given path. Under this setting, we explore two primitive spatial keyword queries, namely k nearest neighbor query and range query. The technical challenges lie in that: (1) retrieving qualified vertices in large road networks efficiently, and (2) issuing the query continuously for points on the path, which turns out to be inapplicable. To overcome the above challenges, we first propose a backbone road network index structure (BNI), which supports the distance computation efficiently and offers a global insights of the whole road network. Motivated by the safe zone technique, we then transform our queries to the issue of finding event points, which capture the changes of answer set. By this transformation, our queries are to be simple and feasible. To answer the queries, we propose a Two-Phase Progressive (TPP) computing framework, which first computes the answer sets for some crucial vertices on the path, and then identifies the event points by the retrieved answer sets. Extensive experiments on both real and synthetic data sets are conducted to evaluate the performance of our proposed algorithms, and the results show that our algorithms outperform competitors by several orders of magnitude. [ABSTRACT FROM AUTHOR]

This study introduces the enhanced dynamic network DEA, an innovative algorithmic extension of the foundational data envelopment analysis (DEA), to assess the sustainable development efficiency of Jiangxi Province's "Internet Plus Logistics" sector from 2002 to 2016. This methodology leverages a comprehensive evaluation indicator system, emphasizing waterway, highway, and railway logistics outputs. The integration of custom algorithms into the CCR and BCC models has provided a deeper insight into efficiency trends and highlighted the need for a shift to an intensive economic model. Key findings pinpoint specific inefficiencies and their causes, emphasizing the value of our method in offering precise insights. Ultimately, this research not only advances the DEA methodological landscape but also offers strategic directions for sustainable development in "Internet Plus Logistics." [ABSTRACT FROM AUTHOR]

Autonomous detection and fishing by underwater robots will be the main way to obtain aquatic products in the future; sea urchins are the main research object of aquatic product detection. When the classical Single-Shot MultiBox Detector (SSD) algorithm is applied to the detection of sea urchins, it also has disadvantages of being inaccurate to small targets and insensitive to the direction of the sea urchin. Based on the classic SSD algorithm, this paper proposes a feature-enhanced sea urchin detection algorithm. Firstly, according to the spiny-edge characteristics of a sea urchin, a multidirectional edge detection algorithm is proposed to enhance the feature, which is taken as the 4th channel of image and the original 3 channels of underwater image together as the input for the further deep learning. Then, in order to improve the shortcomings of SSD algorithm's poor ability to detect small targets, resnet 50 is used as the basic framework of the network, and the idea of feature cross-level fusion is adopted to improve the feature expression ability and strengthen semantic information. The open data set provided by the National Natural Science Foundation of China underwater Robot Competition will be used as the test set and training set. Under the same training and test conditions, the AP value of the algorithm in this paper reaches 81.0%, 7.6% higher than the classic SSD algorithm, and the confidence of small target analysis is also improved. Experimental results show that the algorithm in this paper can effectively improve the accuracy of sea urchin detection. [ABSTRACT FROM AUTHOR]

In order to solve the problem of low accuracy of pedestrian detection of real traffic cameras and high missed detection rate of small target pedestrians, this paper combines autoencoding neural network and AdaBoost to construct a fast pedestrian detection algorithm. Aiming at the problem that a single high-level output feature map has insufficient ability to express pedestrian features and existing methods cannot effectively select appropriate multilevel features, this paper improves the traditional AdaBoost algorithm structure, that is, the sample weight update formula and the strong classifier output formula are reset, and the two-input AdaBoost-DBN classification algorithm is proposed. Moreover, in view of the problem that the fusion video is not smoothly played, this paper considers the motion information of the video object, performs pixel interpolation by motion compensation, and restores the frame rate of the original video by reconstructing the dropped interframe image. Through experimental research, we can see that the algorithm constructed in this paper has a certain effect. [ABSTRACT FROM AUTHOR]

Inspired by the application of CycleGAN networks to the image style conversion problem Zhu et al. (2017), this paper proposes an end-to-end network, DefogNet, for solving the single-image dehazing problem, treating the image dehazing problem as a style conversion problem from a fogged image to a nonfogged image, without the need to estimate a priori information from an atmospheric scattering model. DefogNet improves on CycleGAN by adding a cross-layer connection structure in the generator to enhance the network's multiscale feature extraction capability. The loss function was redesigned to add detail perception loss and color perception loss to improve the quality of texture information recovery and produce better fog-free images. In this paper, the novel Defog-SN algorithm is presented. This algorithm adds a spectral normalization layer to the discriminator's convolution layer to make the discriminant network conform to a 1-Lipschitz continuum and further improve the model's stability. In this study, the experimental process is completed based on the O-HAZE, I-HAZE, and RESIDE datasets. The dehazing results show that the method outperforms traditional methods in terms of PSNR and SSIM on synthetic datasets and Avegrad and Entropy on naturalistic images. [ABSTRACT FROM AUTHOR]

Intelligent manufacturing capability evaluation is the key for enterprises to scientifically formulate the implementation path and continuously improve the level of intelligent manufacturing. To help manufacturing enterprises diagnose the level of intelligent manufacturing capability, this paper conducts research on intelligent manufacturing capability maturity evaluation based on maturity theory. The evaluation problem is a complex nonlinear problem, and BP neural network is particularly suitable for solving such complex mapping problems. Aiming at the problem that the BP neural network is sensitive to initial weights and thresholds, the sparrow search algorithm (SSA) is used to optimize the initial weights and thresholds of the BP neural network. In order to overcome the shortcoming of SSA that it is easy to fall into the local optimum, the firefly disturbance strategy is introduced to improve it, a new sparrow search algorithm (FASSA) is proposed, and on this basis, an intelligent manufacturing capability maturity evaluation model based on the FASSA-BP algorithm is constructed. Finally, a large battery manufacturing enterprise in China is selected for empirical research, and the comparison experiments are carried out on the FASSA-BP model, BP model, SSA-BP model, and PSO-BP model in terms of accuracy, stability, etc. The results show that the evaluation of intelligent manufacturing capability maturity through this model can effectively help companies diagnose problems in the construction of intelligent manufacturing and provide a reference for companies to accurately improve their intelligent manufacturing capabilities. [ABSTRACT FROM AUTHOR]

Digital image data processing is mainly to input digital image data into a computer to complete the conversion of a continuous spatially distributed image model into a discrete digital model so that the computer can identify, process, and store the processing process of digital image information. Geographic information system (GIS) is a computer system that integrates multiple forms of information expression, and it integrates functions such as collection, processing, transmission, storage, management, analysis, expression, and query retrieval, which can quickly discover the spatial distribution of things and their attributes and can express the results accurately and vividly in various intuitive forms. Therefore, on the basis of summarizing and analyzing previous research works, this paper expounded the research status and significance of processing methods for digital image data, elaborated the development background, current status, and future challenges of the GIS technology, introduced the methods and principles of permutation matrix algorithm and subimage averaging method, constructed the processing model for digital image data based on GIS, analyzed the data structure and its database establishment for digital image, proposed the processing methods for digital image data based on GIS, performed the enhancement processing and calculation classification of digital image data, and finally conducted a case analysis and its result discussion. The study results show that the proposed processing methods for digital image data based on GIS can perform analogue-to-digital conversion of continuous images, complete the steps of sampling, layering, and quantization, and then encode the obtained discrete digital signal into the computer to form an in-plane collection of pixels; this processing method can also organically combine spatial information and image data and identify, process, and store digital image data from both spatial and attribute aspects. The study results of this paper provide a reference for further research on the processing methods for digital image data based on GIS. [ABSTRACT FROM AUTHOR]

Community detection of complex networks has always been a hot issue. With the mixed parameters μ increase in network complexity, community detection algorithms need to be improved. Based on previous work, the paper designs a novel algorithm from the perspective of node betweenness properties and gives the detailed steps of the algorithm and simulation results. We compare the proposed algorithm with a series of typical algorithms through experiments on synthetic and actual networks. Experimental results on artificial and real networks demonstrate the effectiveness and superiority of our algorithm. [ABSTRACT FROM AUTHOR]

The label from industrial commodity packaging usually contains important data, such as production date, manufacturer, and other commodity-related information. As such, those labels are essential for consumers to purchase goods, help commodity supervision, and reveal potential product safety problems. Consequently, packaging label detection, as the prerequisite for product label identification, becomes a very useful application, which has achieved promising results in the past decades. Yet, in complex industrial scenarios, traditional detection methods are often unable to meet the requirements, which suffer from many problems of low accuracy and efficiency. In this paper, we propose a multifeature fast and attention-based algorithm using a combination of area suggestion and semantic segmentation. This algorithm is an attention-based efficient and multifeature fast text detector (termed AEMF). The proposed approach is formed by fusing segmentation branches and detection branches with each other. Based on the original algorithm that can only detect text in any direction, it is possible to detect different shapes with a better accuracy. Meanwhile, the algorithm also works better on long-text detection. The algorithm was evaluated using ICDAR2015, CTW1500, and MSRA-TD500 public datasets. The experimental results show that the proposed multifeature fusion with self-attention module makes the algorithm more accurate and efficient than existing algorithms. On the MSRA-TD500 dataset, the AEMF algorithm has an F-measure of 72.3% and a frame per second (FPS) of 8. On the CTW1500 dataset, the AEMF algorithm has an F-measure of 62.3% and an FPS of 23. In particular, the AEMF algorithm has achieved an F-measure of 79.3% and an FPS of 16 on the ICDAR2015 dataset, demonstrating the excellent performance in detecting label text on industrial packaging. [ABSTRACT FROM AUTHOR]

The wanton dissemination of network pseudohealth information has brought great harm to people's health, life, and property. It is important to detect and identify network pseudohealth information. Based on this, this paper defines the concepts of pseudohealth information, data block, and data block integration, designs an architecture that combines the latent Dirichlet allocation (LDA) algorithm and data block update integration, and proposes the combination algorithm model. In addition, crawler technology is used to crawl the pseudohealth information transmitted on the Sina Weibo platform during the "epidemic situation" from February to March 2020 for the simulation test on the experimental case dataset. The research results show that (1) the LDA model can deeply mine the semantic information of network pseudohealth information, obtain the features of document-topic distribution, and classify and train topic features as input variables; (2) the dataset partitioning method can effectively block data according to the text attributes and class labels of network pseudohealth information and can accurately classify and integrate the block data through the data block reintegration method; and (3) considering that the combination model has certain limitations on the detection of network pseudohealth information, the support vector machine (SVM) model can extract the granularity content of data blocks in pseudohealth information in real time, thus greatly improving the recognition performance of the combination model. [ABSTRACT FROM AUTHOR]

To improve the accuracy of the multiple channel integration quality (MCIQ) evaluation, this paper proposes a comprehensive evaluation method using the nonlinear autoregressive exogenous model (NARX) and constructs an index system. First, the entropy method is used to determine the objective weight of each indicator. The indicators used in this paper are process consistency, information consistency, emotional value, procedural value, service structure transparency, online result value, business relevance, and online purchase intention. Second, an improved gray relational analysis (GRA) algorithm is used to obtain the comprehensive gray relational degree between the above eight indicators' standard samples and the tested samples. Then, this study uses the dataset preprocessed with the GRA algorithm for training the NARX model. Then, this study uses the trained model to evaluate the quality of multiple channel integration comprehensively. Next, this study uses standardized methods to quantify the evaluation results to provide new ideas and theoretical guidance for teaching traditional retailers to use the advantages of multiple channels to expand their online business. This paper uses 50,000 consecutive samples of a product for 3 months as a dataset in the experimental part. Through the GRA method and the NARX model, the comprehensive gray relational degree between the test sample and the ideal sample is obtained, and the results are quantified. Experiments show that, compared with the GRA method, this paper's method has a higher degree of fit between the output value and the target value. [ABSTRACT FROM AUTHOR]

The complexity of language is usually reflected in the complexity of sentences. At present, the research of sentence complexity mainly focuses on the analysis of syntactic complexity. In this paper, from the perspective of Leech's theory of sentence semantic structure, the predication structure is taken as the semantic unit to explore the sentence semantic complexity. The predication structures are extracted based on the result of sentence-based syntactic analysis, and then the linear expression sequence of a sentence is converted into a semantic hierarchy based on predicate semantic frameworks; the universality of predicate semantic frameworks is obtained by using the spectral clustering algorithm; and the sentence semantic complexity depends on the universality of predicate semantic frameworks at various layers. The experimental results show that the measurement method of sentence sematic complexity based on predicate semantic frameworks is more effective by comparing with the method that only considers the semantic categories of words in the sentence. [ABSTRACT FROM AUTHOR]

Metaheuristic algorithms are often applied to global function optimization problems. To overcome the poor real-time performance and low precision of the basic salp swarm algorithm, this paper introduces a novel hybrid algorithm inspired by the perturbation weight mechanism. The proposed perturbation weight salp swarm algorithm has the advantages of a broad search scope and a strong balance between exploration and exploitation and retains a relatively low computational complexity when dealing with numerous large-scale problems. A new coefficient factor is introduced to the basic salp swarm algorithm, and new update strategies for the leader position and the followers are introduced in the search phase. The new leader position updating strategy has a specific bounded scope and strong search performance, thus accelerating the iteration process. The new follower updating strategy maintains the diversity of feasible solutions while reducing the computational load. This paper describes the application of the proposed algorithm to low-dimension and variable-dimension functions. This paper also presents iteration curves, box-plot charts, and search-path graphics to verify the accuracy of the proposed algorithm. The experimental results demonstrate that the perturbation weight salp swarm algorithm offers a better search speed and search balance than the basic salp swarm algorithm in different environments. [ABSTRACT FROM AUTHOR]

In this paper, the forest algorithm and the decision tree algorithm are mainly used to analyze students' physical education information, course exam results, and student learning data and relevant feature attributes from the online teaching platform. We aim to generate decision trees using the decision tree algorithm for the purpose of generating classification rules, based on which we can find factors that are important to students' physical education performance and form data basis for improving teaching quality to help teaching management and teachers improve teaching methods and adjust teaching strategies. We specifically achieved this objective by constructing a model for assessing the effectiveness of student teaching, the steps of which include data collection and preparation, data preprocessing (data cleaning, conversion, integration), model construction (algorithm training), and algorithm optimization, as well as realizing the simulation results of the model. At the same time, the importance of the relevant attributes of the model is analyzed, and some measures are proposed to improve the universities: the standard of physical education teaching and the corresponding strategies for improving teaching methods. The mainstream development environment is chosen to ensure the complete operation of the project system that integrates learning, operation, and evaluation. The sports virtual simulation experimental teaching system realized in this paper has good functionality, stability, and application benefits in operation and use. [ABSTRACT FROM AUTHOR]

In this paper, a simple extended Kalman Filter (EKF) controller for direct torque control (DTC) of a six-phase induction machine in all speed ranges is proposed. The aim of this paper is to decrease the execution time of EKF modeling of a six-phase induction motor. The proposed method is fast and can operate online. If the machine parameters are changed during the operation, the EKF algorithm is activated to find parameters used for controlling the motor. In low speed, not only the motor speed measurement but also the DTC of machine is difficult. The EKF model can estimate speed, flux, load torque, and stator resistance in low speed; thus, optimization can be performed in all loads and speed range. The proposed method increases the accuracy of DTC of the six-phase induction machine and decreases the computation cost of the system using the simplified algorithm. The simulation and experimental results verify the effectiveness and the robustness of the proposed method against parameter variations. [ABSTRACT FROM AUTHOR]

In practical application studies of glider formations, ocean currents are a major influencing factor in their path planning. The purpose of this paper is to solve the path planning problem of glider formations in time-varying ocean currents and establish gliders, glider formation, and ocean current models based on existing data. The Doc-CNN architecture is tailored to conform to the operation and environment characteristics of gliders in practical application. After experiments, the algorithm of the improved architecture can be used in the path planning task of glider formation. The algorithm architecture is compared and tested on two datasets, grid maps and ocean maps. Doc-CNN has an advantage over architecture without being tailored to glider characteristics and makes full use of known global information and local information collected by gliders themselves. The results show that the path planning problem of glider formation in ocean currents can be solved by using Doc-CNN. [ABSTRACT FROM AUTHOR]

This paper considers two kinds of stochastic reentrant job shop scheduling problems (SRJSSP), i.e., the SRJSSP with the maximum tardiness criterion and the SRJSSP with the makespan criterion. Owing to the NP-complete complexity of the considered RJSSPs, an effective differential evolutionary algorithm (DEA) combined with two uncertainty handling techniques, namely, DEA_UHT, is proposed to address these problems. Firstly, to reasonably control the computation cost, the optimal computing budget allocation technique (OCBAT) is applied for allocating limited computation budgets to assure reliable evaluation and identification for excellent solutions or individuals, and the hypothesis test technique (HTT) is added to execute a statistical comparison to reduce some unnecessary repeated evaluation. Secondly, a reentrant-largest-order-value rule is designed to convert the DEA's individual (i.e., a continuous vector) to the SRJSSP's solution (i.e., an operation permutation). Thirdly, a conventional active decoding scheme for the job shop scheduling problem is extended to decode the solution for obtaining the criterion value. Fourthly, an Insert-based exploitation strategy and an Interchange-based exploration strategy are devised to enhance DEA's exploitation ability and exploration ability, respectively. Finally, the test results and comparisons manifest the effectiveness and robustness of the proposed DEA_UHT. [ABSTRACT FROM AUTHOR]

In this paper, through an in-depth study and analysis of dance motion capture algorithms in wearable sensor networks, the extended Kalman filter algorithm and the quaternion method are selected after analysing a variety of commonly used data fusion algorithms and pose solving algorithms. In this paper, a sensor-body coordinate system calibration algorithm based on hand-eye calibration is proposed, which only requires three calibration poses to complete the calibration of the whole-body sensor-body coordinate system. In this paper, joint parameter estimation algorithm based on human joint constraints and limb length estimation algorithm based on closed joint chains are proposed, respectively. The algorithm is an iterative optimization algorithm that divides each iteration into an expectation step and a great likelihood step, and the best convergence value can be found efficiently according to each iteration step. The feature values of each pose action are fed into the algorithm for model learning, which enables the training of the model. The trained model is then tested by combining the collected gesture data with the algorithmic model to recognize and classify the gesture data, observe its recognition accuracy, and continuously optimize the model to achieve accurate recognition of human gesture actions. [ABSTRACT FROM AUTHOR]

In recent years, with the development of society and the rapid development of the animation industry, people are paying more and more attention to and requirements for animation production. As an indispensable part of animation production, picture composition plays a major role in animation production. It can give full play to the application of color matching and light and shadow design and enhance the depth and space of the animation screen. Tone space conversion refers to the conversion or representation of color data in one color space into corresponding data in another color space. Its purpose is to distinguish and process color components such as hue and saturation in an image. This article first introduces the domestic and foreign research status of digital image preprocessing and analyzes the basic principles of several color space conversions in detail. Then, several color space conversion algorithms are studied, and the performance of the algorithms is compared and analyzed. The paper focuses on the hardware implementation and optimization of the algorithm for converting RGB color space into HSI color space to meet the real-time requirements. This article focuses on the mutual conversion between the RGB tone space and the HSI tone space and describes in detail how each color component in the HSI tone space is converted from the three RGB color components from a geometric perspective, and then the conversion is derived, and several general conversion methods of RGB to HSI tone space are introduced; two conversion methods of geometric derivation method and standard modulus algorithm are implemented in the software, and the comparison verification is carried out, and the comparison is made from the perspective of hardware implementation. The pros and cons of the two methods are discussed. Finally, the paper summarizes the shortcomings in the design and proposes further research directions in the future. [ABSTRACT FROM AUTHOR]

Focusing on DOTA, the multidirectional object dataset in aerial view of vehicles, CMDTD has been proposed. The reason why it is difficult for applying the general object detection algorithm in multidirectional object detection has been analyzed in this paper. Based on this, the detection principle of CMDTD including its backbone network and multidirectional multi-information detection end module has been studied. In addition, in view of the complexity of the scene faced by aerial view of vehicles, a unique data expansion method is proposed. At last, three datasets have been experimented using the CMDTD algorithm, proving that the cascaded multidirectional object detection algorithm with high effectiveness is superior to other methods. [ABSTRACT FROM AUTHOR]

Aiming at the problem of low accuracy of edge detection of the film and television lens, a new SIFT feature-based camera detection algorithm was proposed. Firstly, multiple frames of images are read in time sequence and converted into grayscale images. The frame image is further divided into blocks, and the average gradient of each block is calculated to construct the film dynamic texture. The correlation of the dynamic texture of adjacent frames and the matching degree of SIFT features of two frames were compared, and the predetection results were obtained according to the matching results. Next, compared with the next frame of the dynamic texture and SIFT feature whose step size is lower than the human eye refresh frequency, the final result is obtained. Through experiments on multiple groups of different types of film and television data, high recall rate and accuracy rate can be obtained. The algorithm in this paper can detect the gradual change lens with the complex structure and obtain high detection accuracy and recall rate. A lens boundary detection algorithm based on fuzzy clustering is realized. The algorithm can detect sudden changes/gradual changes of the lens at the same time without setting a threshold. It can effectively reduce the factors that affect lens detection, such as flash, movies, TV, and advertisements, and can reduce the influence of camera movement on the boundaries of movies and TVs. However, due to the complexity of film and television, there are still some missing and false detections in this algorithm, which need further study. [ABSTRACT FROM AUTHOR]

Parallel processing as a method to improve computer performance has become a development trend. Based on rough set theory and divide-and-conquer idea of knowledge reduction, this paper proposes a classification method that supports parallel attribute reduction processing, the method makes the relative positive domain which needs to be calculated repeatedly independent, and the independent relative positive domain calculation could be processed in parallel; thus, attribute reduction could be handled in parallel based on this classification method. Finally, the proposed algorithm and the traditional algorithm are analyzed and compared by experiments, and the results show that the proposed method in this paper has more advantages in time efficiency, which proves that the method could improve the processing efficiency of attribute reduction and makes it more suitable for massive data sets. [ABSTRACT FROM AUTHOR]