DISTANCE-BASED UPDATE STRATEGY IN LDCQ

A new update strategy, distance-based update strategy, is presented in Location Dependent Continuous Query (LDCQ) under error limitation. There are different possibilities to intersect when the distances between moving objects and the querying boundary are different.Therefore, moving objects have different influences to the query result. We set different deviation limits for different moving objects according to distances. A great number of unnecessary updates are reduced and the payload of the system is relieved.

Improved Harris Hawks Algorithm and Its Application in Feature Selection

This research focuses on improving the Harris’Hawks Optimization algorithm(HHO)by tackling several of its shortcomings,including insufficient population diversity,an imbalance in exploration vs.exploitation,and a lack of thorough exploitation depth.To tackle these shortcomings,it proposes enhancements from three distinct perspectives:an initialization technique for populations grounded in opposition-based learning,a strategy for updating escape energy factors to improve the equilibrium between exploitation and exploration,and a comprehensive exploitation approach that utilizes variable neighborhood search along with mutation operators.The effectiveness of the Improved Harris Hawks Optimization algorithm(IHHO)is assessed by comparing it to five leading algorithms across 23 benchmark test functions.Experimental findings indicate that the IHHO surpasses several contemporary algorithms its problem-solving capabilities.Additionally,this paper introduces a feature selection method leveraging the IHHO algorithm(IHHO-FS)to address challenges such as low efficiency in feature selection and high computational costs(time to find the optimal feature combination and model response time)associated with high-dimensional datasets.Comparative analyses between IHHO-FS and six other advanced feature selection methods are conducted across eight datasets.The results demonstrate that IHHO-FS significantly reduces the computational costs associated with classification models by lowering data dimensionality,while also enhancing the efficiency of feature selection.Furthermore,IHHO-FS shows strong competitiveness relative to numerous algorithms.

Adaptive Nonlinear Model Predictive Control Using an On-line Support Vector Regression Updating Strategy

The performance of data-driven models relies heavily on the amount and quality of training samples, so it might deteriorate significantly in the regions where samples are scarce. The objective of this paper is to develop an online SVR model updating strategy to track the change in the process characteristics efficiently with affordable computational burden. This is achieved by adding a new sample that violates the Karush–Kuhn–Tucker conditions of the existing SVR model and by deleting the old sample that has the maximum distance with respect to the newly added sample in feature space. The benefits offered by such an updating strategy are exploited to develop an adaptive model-based control scheme, where model updating and control task perform alternately.The effectiveness of the adaptive controller is demonstrated by simulation study on a continuous stirred tank reactor. The results reveal that the adaptive MPC scheme outperforms its non-adaptive counterpart for largemagnitude set point changes and variations in process parameters.

A 2-stage strategy updating rule promotes cooperation in the prisoner's dilemma game

In this study,we propose a spatial prisoner＇s dilemma game model with a 2-stage strategy updating rule,and focus on the cooperation behavior of the system.In the first stage,i.e.,the pre-learning stage,a focal player decides whether to update his strategy according to the pre-learning factor β and the payoff difference between himself and the average of his neighbors.If the player makes up his mind to update,he enters into the second stage,i.e.,the learning stage,and adopts a strategy of a randomly selected neighbor according to the standard Fermi updating rule.The simulation results show that the cooperation level has a non-trivial dependence on the pre-learning factor.Generally,the cooperation frequency decreases as the pre-learning factor increases;but a high cooperation level can be obtained in the intermediate region of- 3〈 β 〈-1.We then give some explanations via studying the co-action of pre-learning and learning.Our results may sharpen the understanding of the influence of the strategy updating rule on evolutionary games.

An adaptive ant colony system algorithm for continuous-space optimization problems

Ant colony algorithms comprise a novel category of evolutionary computation methods for optimization problems, especially for sequencing-type combinatorial optimization problems. An adaptive ant colony algorithm is proposed in this paper to tackle continuous-space optimization problems, using a new objective-function-based heuristic pheromone assignment approach for pheromone update to filtrate solution candidates.Global optimal solutions can be reached more rapidly by self-adjusting the path searching behaviors of the ants according to objective values. The performance of the proposed algorithm is compared with a basic ant colony algorithm and a Square Quadratic Programming approach in solving two benchmark problems with multiple extremes. The results indicated that the efficiency and reliability of the proposed algorithm were greatly improved.

A User-Transformer Relation Identification Method Based on QPSO and Kernel Fuzzy Clustering

User-transformer relations are significant to electric power marketing,power supply safety,and line loss calculations.To get accurate user-transformer relations,this paper proposes an identification method for user-transformer relations based on improved quantum particle swarm optimization(QPSO)and Fuzzy C-Means Clustering.The main idea is:as energymeters at different transformer areas exhibit different zero-crossing shift features,we classify the zero-crossing shift data from energy meters through Fuzzy C-Means Clustering and compare it with that at the transformer end to identify user-transformer relations.The proposed method contributes in three main ways.First,based on the fuzzy C-means clustering algorithm(FCM),the quantum particle swarm optimization(PSO)is introduced to optimize the FCM clustering center and kernel parameters.The optimized FCM algorithm can improve clustering accuracy and efficiency.Since easily falls into a local optimum,an improved PSO optimization algorithm(IQPSO)is proposed.Secondly,considering that traditional FCM cannot solve the linear inseparability problem,this article uses a FCM(KFCM)that introduces kernel functions.Combinedwith the IQPSOoptimization algorithm used in the previous step,the IQPSO-KFCM algorithm is proposed.Simulation experiments verify the superiority of the proposed method.Finally,the proposed method is applied to transformer detection.The proposed method determines the class members of transformers and meters in the actual transformer area,and obtains results consistent with actual user-transformer relations.This fully shows that the proposed method has practical application value.

A Selective Moving Window Partial Least Squares Method and Its Application in Process Modeling

A selective moving window partial least squares(SMW-PLS) soft sensor was proposed in this paper and applied to a hydro-isomerization process for on-line estimation of para-xylene(PX) content. Aiming at the high frequency of model updating in previous recursive PLS methods, a selective updating strategy was developed. The model adaptation is activated once the prediction error is larger than a preset threshold, or the model is kept unchanged.As a result, the frequency of model updating is reduced greatly, while the change of prediction accuracy is minor.The performance of the proposed model is better as compared with that of other PLS-based model. The compromise between prediction accuracy and real-time performance can be obtained by regulating the threshold. The guidelines to determine the model parameters are illustrated. In summary, the proposed SMW-PLS method can deal with the slow time-varying processes effectively.

A Novel Method Based on Nonlinear Binary Grasshopper Whale Optimization Algorithm for Feature Selection

Feature Selection(FS)is considered as an important preprocessing step in data mining and is used to remove redundant or unrelated features from high-dimensional data.Most optimization algorithms for FS problems are not balanced in search.A hybrid algorithm called nonlinear binary grasshopper whale optimization algorithm(NL-BGWOA)is proposed to solve the problem in this paper.In the proposed method,a new position updating strategy combining the position changes of whales and grasshoppers population is expressed,which optimizes the diversity of searching in the target domain.Ten distinct high-dimensional UCI datasets,the multi-modal Parkinson's speech datasets,and the COVID-19 symptom dataset are used to validate the proposed method.It has been demonstrated that the proposed NL-BGWOA performs well across most of high-dimensional datasets,which shows a high accuracy rate of up to 0.9895.Furthermore,the experimental results on the medical datasets also demonstrate the advantages of the proposed method in actual FS problem,including accuracy,size of feature subsets,and fitness with best values of 0.913,5.7,and 0.0873,respectively.The results reveal that the proposed NL-BGWOA has comprehensive superiority in solving the FS problem of high-dimensional data.

Variable-fidelity optimization with design space reduction

Advanced engineering systems, like aircraft, are defined by tens or even hundreds of design variables. Building an accurate surrogate model for use in such high-dimensional optimization problems is a difficult task owing to the curse of dimensionality. This paper presents a new algorithm to reduce the size of a design space to a smaller region of interest allowing a more accurate surrogate model to be generated. The framework requires a set of models of different physical or numerical fidelities. The low-fidelity （LF） model provides physics-based approximation of the high-fidelity （HF） model at a fraction of the computational cost. It is also instrumental in identifying the small region of interest in the design space that encloses the high-fidelity optimum. A surrogate model is then constructed to match the low-fidelity model to the high-fidelity model in the identified region of interest. The optimization process is managed by an update strategy to prevent convergence to false optima. The algorithm is applied on mathematical problems and a two-dimen-sional aerodynamic shape optimization problem in a variable-fidelity context. Results obtained are in excellent agreement with high-fidelity results, even with lower-fidelity flow solvers, while showing up to 39% time savings.

Application of Improved Compact Particle Swarm Optimization to Large Ontology Alignment Task

Ontology occupies an important position in artificial intelligence,computer linguistics and knowledge management.However,when different ontologies are constructed to represent the same information in a domain,the so-called heterogeneity problem arises.In order to address this problem,a key task is to discover the semantic relationship of entities between given two ontologies,called ontology alignment.Recently,the meta-heuristic algorithms have already been regarded as an effective approach for solving ontology alignment problem.However,firstly,as the ontologies become increasingly large,meta-heuristic algorithms may be easier to find local optimal alignment in large search spaces.Secondly,many existing approaches exploit the population-based meta-heuristic algorithms so that the massive calculation is required.In this paper,an improved compact particle swarm algorithm by using a local search strategy is proposed,called LSCPSOA,to improve the performance of finding more correct correspondences.In LSCPSOA,two update strategies with local search capability are employed to avoid falling into a local optimal alignment.The proposed algorithm has been evaluated on several large ontology data sets and compared with existing ontology alignment methods.The experimental results show that the proposed algorithm can find more correct correspondences and improves the time performance compared with other meta-heuristic algorithms.

Edge-cloud collaborative intelligent production scheduling based on digital twin

With the application of various information technologies in smart manufacturing,new intelligent production mode puts forward higher demands for real-time and robustness of production scheduling.For the production scheduling problem in large-scale manufacturing environment,digital twin(DT)places high demand on data processing capability of the terminals.It requires both global prediction and real-time response abilities.In order to solve the above problem,a DT-based edge-cloud collaborative intelligent production scheduling(DTECCS)system was proposed,and the scheduling model and method were introduced.DT-based edge-cloud collaboration(ECC)can predict the production capacity of each workshop,reassemble customer orders,optimize the allocation of global manufacturing resources in the cloud,and carry out distributed scheduling on the edge-side to improve scheduling and tasks processing efficiency.In the production process,the DTECCS system adjusts scheduling strategies in real-time,responding to changes in production conditions and order fluctuations.Finally,simulation results show the effectiveness of DTECCS system.