Search

In the era of e-commerce, accurately predicting user purchase intentions has become a crucial factor for enhancing sales efficiency and optimizing the customer experience. Addressing the limitations of traditional ensemble strategies, which often suffer from subjective biases during the model design phase, this paper introduced an adaptive evolutionary ensemble learning model to predict user purchase intentions. This model adaptively selected the optimal base learners and meta-learners, incorporating both the predictive information from the base learners and the differential information between features to expand the feature dimensions, enhancing prediction accuracy. Moreover, to further refine the predictive capabilities of the model, this paper designed a binary adaptive differential evolution algorithm for feature selection, aiming to identify features that significantly influence the prediction outcome. Research results show that the binary adaptive differential evolution algorithm outperforms traditional optimization algorithms in global searches and feature selection. Compared to six common ensemble models and the DeepForest model, the proposed evolutionary ensemble model achieves a 2.76% and 2.72% increase in AUC value, respectively, and effectively mitigates the impacts of data imbalance [ABSTRACT FROM AUTHOR]

In Intelligent Transport Systems (ITSs), Internet of Vehicles (IoV) communications and computation offloading technology have been introduced to assist with the burdensome sensing task processing, thus prompting a new design paradigm called mobile sensing–communication–computation (MSCC) synergy. Most researchers have focused on offloading strategy design to reduce energy consumption or execution costs, but ignore the intrinsic characteristics of tasks, which may lead to poor performance. This paper studies the offloading strategy of vehicle MSCC tasks represented by a Directed Acyclic Graph (DAG) structure. According to the DAG dependency of the subtasks, this paper proposes a computation offloading strategy to optimize energy consumption under time constraints. An energy consumption model for task execution is established. Then, the Simulated Annealing and Tabu Search hybrid optimization algorithm (ST-HO) is designed to solve the problem of minimizing the energy consumption. Crucially, this research integrates the concept of symmetry into the typical DAG structure of MSCC tasks, ensuring the integrity and efficiency of task execution in ITS. The simulation results show that ST-HO reduces energy consumption by at least 5.58% compared to the conventional algorithm. Particularly, the convergence speed of ST-HO is improved by 52.63% when the replication strategy of symmetric task is considered. [ABSTRACT FROM AUTHOR]

Economic Dispatch Problems (EDP) refer to the process of determining the power output of generation units such that the electricity demand of the system is satisfied at a minimum cost while technical and operational constraints of the system are satisfied. This procedure is vital in the efficient energy management of electricity networks since it can ensure the reliable and efficient operation of power systems. As power systems transition from conventional to modern ones, new components and constraints are introduced to power systems, making the EDP increasingly complex. This highlights the importance of developing advanced optimization techniques that can efficiently handle these new complexities to ensure optimal operation and cost-effectiveness of power systems. This review paper provides a comprehensive exploration of the EDP, encompassing its mathematical formulation and the examination of commonly used problem formulation techniques, including single and multi-objective optimization methods. It also explores the progression of paradigms in economic dispatch, tracing the journey from traditional methods to contemporary strategies in power system management. The paper categorizes the commonly utilized techniques for solving EDP into four groups: conventional mathematical approaches, uncertainty modelling methods, artificial intelligence-driven techniques, and hybrid algorithms. It identifies critical research gaps, a predominant focus on single-case studies that limit the generalizability of findings, and the challenge of comparing research due to arbitrary system choices and formulation variations. The present paper calls for the implementation of standardized evaluation criteria and the inclusion of a diverse range of case studies to enhance the practicality of optimization techniques in the field. [ABSTRACT FROM AUTHOR]

The zero-velocity update (ZUPT) algorithm is a pivotal advancement in pedestrian navigation accuracy, utilizing foot-mounted inertial sensors. Its key issue hinges on accurately identifying periods of zero-velocity during human movement. This paper introduces an innovative adaptive sliding window technique, leveraging the Fourier Transform to precisely isolate the pedestrian's gait frequency from spectral data. Building on this, the algorithm adaptively adjusts the zero-velocity detection threshold in accordance with the identified gait frequency. This adaptation significantly refines the accuracy in detecting zero-velocity intervals. Experimental evaluations reveal that this method outperforms traditional fixed-threshold approaches by enhancing precision and minimizing false positives. Experiments on single-step estimation show the adaptability of the algorithm to motion states such as slow, fast, and running. Additionally, the paper demonstrates pedestrian trajectory localization experiments under a variety of walking conditions. These tests confirm that the proposed method substantially improves the performance of the ZUPT algorithm, highlighting its potential for pedestrian navigation systems. [ABSTRACT FROM AUTHOR]

Truck hoisting detection constitutes a key focus in port security, for which no optimal resolution has been identified. To address the issues of high costs, susceptibility to weather conditions, and low accuracy in conventional methods for truck hoisting detection, a non-intrusive detection approach is proposed in this paper. The proposed approach utilizes a mathematical model and an extreme gradient boosting (XGBoost) model. Electrical signals, including voltage and current, collected by Hall sensors are processed by the mathematical model, which augments their physical information. Subsequently, the dataset filtered by the mathematical model is used to train the XGBoost model, enabling the XGBoost model to effectively identify abnormal hoists. Improvements were observed in the performance of the XGBoost model as utilized in this paper. Finally, experiments were conducted at several stations. The overall false positive rate did not exceed 0.7% and no false negatives occurred in the experiments. The experimental results demonstrated the excellent performance of the proposed approach, which can reduce the costs and improve the accuracy of detection in container hoisting. [ABSTRACT FROM AUTHOR]

Summary: This paper addresses the problem of switching control for systems subject to external disturbances that vary over multiple frequency ranges. Specifically, two different scenarios of disturbance injection are considered; namely, the disturbance may switch between different prescribed frequency ranges, subject to an average dwell time setting, or the disturbance may reside within one of the frequency ranges. To address these scenarios, a disturbance‐triggered control scheme is developed that divides the entire frequency range into low‐, mid‐, and high‐frequency ranges. This scheme ensures closed‐loop stability under average dwell time frequency‐range switching and achieves H∞$$ {H}_{\infty } $$ performance when operated under individual frequency ranges. Synthesis conditions in matrix inequalities are derived to characterize the switching control, and an iterative algorithm is proposed for finding a desired set of controller gains. Finally, two examples are presented to illustrate the effectiveness of the proposed control method. [ABSTRACT FROM AUTHOR]

Summary: In this paper, we use the maximum likelihood principle and the negative gradient search principle to study the identification issues of the multivariate equation‐error systems whose outputs are contaminated by an moving average noise process. The model decomposition technique is used to decompose the system into several regressive identification subsystems based on the number of the outputs. In order to improve the parameter estimation accuracy, a decomposition‐based multivariate maximum likelihood gradient iterative algorithm is proposed by means of the maximum likelihood principle and the iterative identification method. The numerical simulation example indicates that the proposed method has better parameter estimation results than the compared decomposition‐based multivariate maximum likelihood gradient algorithm. [ABSTRACT FROM AUTHOR]

This paper discusses the problem of estimating a stochastic signal from nonlinear uncertain observations with time-correlated additive noise described by a first-order Markov process. Random deception attacks are assumed to be launched by an adversary, and both this phenomenon and the uncertainty in the observations are modelled by two sets of Bernoulli random variables. Under the assumption that the evolution model generating the signal to be estimated is unknown and only the mean and covariance functions of the processes involved in the observation equation are available, recursive algorithms based on linear approximations of the real observations are proposed for the least-squares filtering and fixed-point smoothing problems. Finally, the feasibility and effectiveness of the developed estimation algorithms are verified by a numerical simulation example, where the impact of uncertain observation and deception attack probabilities on estimation accuracy is evaluated. [ABSTRACT FROM AUTHOR]

In many real navigation problems, moving objects may have some state or measurement constraints along their way. Using these constraints in conventional Extended Kalman Filter (EKF) equations results large matrices which are computationally time-consuming. In this paper, a new Constrained Navigation Filter (CNF) is proposed as a parallel to reduce the computational burden of the conventional EKF algorithm while increasing the positioning accuracy. So a methodology has been developed for Strap-down Inertial Navigation System (SINS) based on MEMS IMU applied on Pipeline Inspection Gauge (PIG) to sense data at constant sampling rate of 108 km of the pipeline. The results verified that using such a hybrid approach has improved positional accuracy 8.97% in comparison with that of the latest methods like EKF/ Pipe Line Junctions (PLJ). Also, the proposed method is 2.277 times better than EKF/PLJ in the algorithm runtime. [ABSTRACT FROM AUTHOR]

The difficulty of scheduling jobs or workloads increases due to the stochastic and transient characteristics of the cloud network. As a key prerequisite for establishing QoS, it asserts that effective work scheduling must be developed and executed. Maximum profit is made possible for cloud service providers by proper resource management. The most effective scheduling algorithm considers resources given by providers rather than the task set that users have accumulated. This paper developed a model that works in a two-level hierarchical model comprising global scheduling and local schedules to handle the heterogeneous type of request in real-time. These two levels of scheduling communicate with each other to produce an optimal scheduling scheme. Initially, all the requests are passed to the global scheduler, whose task is to categorize the type of request and pass it to the corresponding queue for assigning it to the related local scheduler using a parabolic intuitionistic fuzzy scheduler. In this work, the heterogeneous types of files are handled by maintaining different queues, in which each queue handles only a specific type of file like text doc, audio, image and video. Once the type of req is initiated by the clients, the global scheduler identifies the type of request and passes it to their relevant queue. In the next level, the local scheduler is assigned to each type of web server cluster. Once the work request is dispatched from the global workload scheduler, it is allocated to the local queue of the local scheduler, which allocates the resources of web servers by adapting the Quantum Honey Badger Algorithm, which searches the best-suited server for completing the assigned work based on the available resource parameters. [ABSTRACT FROM AUTHOR]

For a class of discrete-time nonlinear systems, this paper proposes a discrete-time sliding mode control algorithm with an exponential term that acts as a variable gain to improve the convergence to a bounded region around the origin for the state variable. To compensate for unknown, but bounded disturbances, it has been employed a discontinuous function through a discrete-time integral action. A discrete-time neural network has also been employed to identify such nonlinear system with a block controllable structure. Finally, the proposed controller and the neural network algorithms are applied to a discretised direct current (DC) motor to follow a desired admissible trajectory. Numerical simulations show the effectiveness of the proposed control law. [ABSTRACT FROM AUTHOR]

Purpose: This paper delves into the aerodynamic optimization of a single-stage axial turbine employed in aero-engines. Design/methodology/approach: An efficient integrated design optimization approach tailored for turbine blade profiles is proposed. The approach combines a novel hierarchical dynamic switching PSO (HDSPSO) algorithm with a parametric modeling technique of turbine blades and high-fidelity Computational Fluid Dynamics (CFD) simulation analysis. The proposed HDSPSO algorithm introduces significant enhancements to the original PSO in three pivotal aspects: adaptive acceleration coefficients, distance-based dynamic neighborhood, and a switchable learning mechanism. The core idea behind these improvements is to incorporate the evolutionary state, strengthen interactions within the swarm, enrich update strategies for particles, and effectively prevent premature convergence while enhancing global search capability. Findings: Mathematical experiments are conducted to compare the performance of HDSPSO with three other representative PSO variants. The results demonstrate that HDSPSO is a competitive intelligent algorithm with significant global search capabilities and rapid convergence speed. Subsequently, the HDSPSO-based integrated design optimization approach is applied to optimize the turbine blade profiles. The optimized turbine blades have a more uniform thickness distribution, an enhanced loading distribution, and a better flow condition. Importantly, these optimizations lead to a remarkable improvement in aerodynamic performance under both design and non-design working conditions. Originality/value: These findings highlight the effectiveness and advancement of the HDSPSO-based integrated design optimization approach for turbine blade profiles in enhancing the overall aerodynamic performance. Furthermore, it confirms the great prospects of the innovative HDSPSO algorithm in tackling challenging tasks in practical engineering applications. [ABSTRACT FROM AUTHOR]

In this paper we present and provide a proof for a set of non-recursive formulae arising in the computation of the largest output-nulling and the smallest input-containing subspaces which have been used in a variety of contexts in the framework of the geometric approach. These expressions have been used in the literature both in the strictly proper and in the non-strictly proper case, but, to the best of our knowledge, a proof is still missing. These formulae are established here in the general possibly non-strictly proper case. Some ancillary side results of independent interest are also proposed. [ABSTRACT FROM AUTHOR]

YOLOv7 is one of the most effective algorithms for one‐stage detectors. However, when it is applied to pedestrian detection tasks in the industrial scene, it is still challenging for complex environments and multi‐scale changes of pedestrians. This paper proposes a new pedestrian detector for the industrial scene based on improved YOLOv7‐tiny and named as GP‐YOLO. First, the neck of YOLOv7‐tiny is replaced by RepGFPN structure, make full use of multi‐scale features to enhance the detection accuracy of objects with large‐scale changes. Second, a new gnconv branch is added to the feature fusion module, and the high‐order spatial interaction capability is introduced to further enhance the target detection accuracy. Finally, a lightweight method based on PModule is proposed, on this basis, a PConv bottleneck is designed to reduce the FLOPs and enhance the feature extraction. Experiments on a self‐made Industrial Pedestrian Data set show that before lightweight, the proposed algorithm achieves a 3.2% improvement in mAP@0.5:0.95 and a 3.7% improvement in Recall compared to the baseline YOLOv7‐tiny. After lightweight GP‐YOLO, compared to non‐lightweight, parameters and FLOPs are decreased by 26% and 23%, respectively, the mAP@0.5:0.95 is decreased by only 1.1% and the Recall is decreased by only 1.3%, which remains at a high level. Compared with baseline YOLOv7‐tiny, the lightweight GP‐YOLO has similar parameters and FLOPs, but the mAP@0.5:0.95 is increased by 2.1%, and the Recall is increased by 2.4%. © 2024 Institute of Electrical Engineers of Japan and Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

In this paper, a novel non-convex fractional-order image denoising model is proposed to suppress the staircase effect produced by the TV model while maintaining a neat contour. The model combines ℓ q (0 < q < 1) quasi-norm and fractional-order regularization, and employs a diffusion coefficient with a faster convergence rate to preserve more image edges and details. Additionally, an adaptive regularization parameter is designed to adjust the denoising performance of the algorithm. To obtain the optimal approximate solution of the model, an enhanced primal-dual algorithm is adopted and the complexity and convergence of the algorithm are theoretically analyzed. Finally, the effectiveness of the proposed method is demonstrated through numerical experiments. • A new non-convex FOTV model is proposed. • A new diffusion coefficient is introduced to retain more edge details of the image. • The existing primal-dual algorithm is improved, and the convergence of this algorithm is analyzed. • An adaptive regularization parameter is designed. [ABSTRACT FROM AUTHOR]

In the online facility assignment problem OFA (k , { c i } i = 1 k) , there exist k servers s 1 , ... , s k on a metric space where each s i has an integer capacity c i and a request arrives one-by-one. The task of an online algorithm is to irrevocably match a current request with one of the servers with vacancies before the next request arrives. As special cases for OFA (k , { c i } i = 1 k) , we consider OFA (k , { c i } i = 1 k) on a line , which is denoted by OFAL (k , { c i } i = 1 k) and OFAL eq (k , { c i } i = 1 k) , where the latter is the case of OFAL (k , { c i } i = 1 k) with equidistant servers. In this paper, we perform the competitive analysis for the above problems. As a natural generalization of the greedy algorithm grdy, we introduce a class of algorithms called MPFS (Most Preferred Free Servers) and show that any MPFS algorithm has the capacity-insensitive property, i.e., for any MPFS algorithm alg for OFA (k , { c i } i = 1 k) , if alg is c -competitive when c 1 = ⋯ = c k = 1 , then alg is c -competitive for general { c i } i = 1 k . By applying the capacity-insensitive property of the greedy algorithm grdy, we derive the matching upper and lower bounds 4 k − 5 on the competitive ratio of grdy for OFAL eq (k , { c i } i = 1 k). To investigate the capability of MPFS algorithms, we show that the competitive ratio of any MPFS algorithm alg for OFAL eq (k , { c i } i = 1 k) is at least 2 k − 1. Then, we propose a new MPFS algorithm idas (Interior Division for Adjacent Servers) for OFAL (k , { c i } i = 1 k) and show that the competitive ratio of idas for OFAL eq (k , { c i } i = 1 k) is at most 2 k − 1 , i.e., idas for OFAL eq (k , { c i } i = 1 k) is best possible in all the MPFS algorithms. We also give numerical experiments to investigate the performance of idas and grdy and show that idas performs better than grdy for distribution of request sequences with locality. [ABSTRACT FROM AUTHOR]

This article delves into the critical realm of modern computer cluster management. It focuses on the effect that the increasing heterogeneity of the clusters has on the workload managers. The proposed schedulers consider node properties instead of job properties to make decisions, which is something not currently done by mainstream scheduling algorithms. In order to increase the knowledge in this topic, this paper proposes two novel algorithms whose main task is to choose the best compute nodes to schedule the incoming jobs. To this effect, they exclusively take into account the properties of the nodes, instead of the common trend of considering the properties of the jobs. The experimental results show that these algorithms outperform well-known heuristic algorithms found in the literature. [ABSTRACT FROM AUTHOR]

The problem of weight degradation is inevitable in particle filtering algorithms, and the resampling approach is an important method to reduce the particle degradation phenomenon. To solve the problem of particle diversity loss in existing resampling methods, this paper proposes a new digital twin-based resampling algorithm to improve the accuracy of particle filter estimation based on the traditional resampling algorithm. The digital twin-based resampling algorithm continuously improves the resampling process through the data interaction between the data model and the physical model, and realizes the real-time correction capability of particle weights that traditional resampling methods do not have. The new algorithm calibration rules are divided according to the size of particle weights, with particles of large weights retained and particles of small weights selectively processed. Compared with the traditional resampling algorithm, the new resampling algorithm reduces the mean square error of the particle filter estimation results by 16.62 % , 16.49 % , and 13.86 % , and improves the computing speed by 7.67 % , 2.25 % , and 7.54 % , respectively, in the simulation experiments of nonlinear systems with univariate unsteady state growth model. The algorithm is experimentally demonstrated to accurately track a person in motion in an indoor building in a non-rigid target tracking application, which illustrates the effectiveness and reasonableness of the digital twin-based resampling algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we reveal and study a new challenging problem faced by object Re-IDentification (ReID), i.e., Coupled Noisy Labels (CNL) which refers to the Noisy Annotation (NA) and the accompanied Noisy Correspondence (NC). Specifically, NA refers to the wrongly-annotated identity of samples during manual labeling, and NC refers to the mismatched training pairs including false positives and false negatives whose correspondences are established based on the NA. Clearly, CNL will limit the success of the object ReID paradigm that simultaneously performs identity-aware discrimination learning on the data samples and pairwise similarity learning on the training pairs. To overcome this practical but ignored problem, we propose a robust object ReID method dubbed Learning with Coupled Noisy Labels (LCNL). In brief, LCNL first estimates the annotation confidences of samples and then adaptively divides the training pairs into four groups with the confidences to rectify the correspondences. After that, LCNL employs a novel objective function to achieve robust object ReID with theoretical guarantees. To verify the effectiveness of LCNL, we conduct extensive experiments on five benchmark datasets in single- and cross-modality object ReID tasks compared with 14 algorithms. The code could be accessed from https://github.com/XLearning-SCU/2024-IJCV-LCNL. [ABSTRACT FROM AUTHOR]

In this paper, we study split common fixed point problems with multiple output sets in Hilbert spaces. For solving this problem, we improve Reich and Tuyen's algorithms [10] and propose two new self-adaptive algorithms which do not need any priori information on the norms of the transfer operators. Then, we establish weak convergence theorems for them. It can be seen from our numerical experiments that the proposed methods depict a very significant improvement in terms of the number of iterations and execution time. [ABSTRACT FROM AUTHOR]

The forward-reflected-backward splitting method recently introduced for solving variational inclusion problems involves just one forward evaluation and one backward evaluation of the monotone operator and the maximal monotone operator, respectively, per iteration. This structure gives it some advantage over the earlier proposed methods. However, it only provides weak convergence, in general. Our aim in this paper is to improve the forward-reflected-backward splitting method in order to obtain strong convergence. To this end, we first study a regularized variational inclusion problem of finding the zero of the sum of two monotone operators. We then propose a regularized forward-reflected-backward splitting method for approximating a solution to the problem and prove the strong convergence of our iterative scheme under some suitable assumptions on the parameters. Moreover, we show that our algorithm has the bounded perturbation resilience property. Furthermore, we apply our results to convex minimization, split feasibility, split variational inclusion, and image deblurring problems, and illustrate the performance of our algorithm with several numerical examples. [ABSTRACT FROM AUTHOR]

In this paper, we present an inertial projection and contraction algorithm (IPCA for short) for variational inequality problems (VIP for short) without Lipschitz continuity of the underlying mapping in Euclidean space. To obtain a larger step, the next iterate point of IPCA is generated by projecting the current iterate point onto a selected half-space, which is selected from finite half-spaces (one half-space can strictly separate the current iterate point from the solution set of VIP and other half-spaces are all contain the solution set of VIP) and has the largest distance to the current iterate point. Moreover, a new initial step-size strategy is used to accelerate IPCA. The global convergence of the sequence generated by IPCA is established. Numerical experiments show that IPCA can accelerate PCA both from the number of iterations point of view and the number of projections point of view. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel rank-adaptive higher-order orthogonal iteration (RA-HOOI) algorithm to solve the fixed-accuracy low multilinear-rank approximation of tensors. On the one hand, RA-HOOI relies on a greedy strategy to expand the subspace, which avoids computing the full SVD of the matricization of the input tensor. On the other hand, the new rank-adaptive strategy introduced in the RA-HOOI algorithm enables the obtained truncation to be more accurate. A series of numerical experiments related to synthetic and real-world tensors are carried out to show that the proposed RA-HOOI algorithm is comparable to state-of-the-art methods in terms of both accuracy and efficiency and performs better in certain situations. [ABSTRACT FROM AUTHOR]

As the world's transport infrastructure ages, the importance of bridge condition monitoring is becoming increasingly acknowledged. Large-scale deployment of existing inspection and monitoring techniques is infeasible due to cost and logistical challenges. The concept of using sensors located within vehicles for low cost 'drive-by' monitoring has become the focus of much attention in recent years. This paper presents a new data-driven approach for drive-by bridge monitoring. Machine learning techniques are leveraged to allow the influence of vehicle speed to be considered and the Operating Deflection Shape Ratio (ODSR) is presented as an alternative damage-sensitive feature to the commonly used frequency spectrum. Extensive laboratory experiments demonstrate that the method is capable of detecting midspan cracking and seized bearings. A statistical classification approach is adopted to classify damage indicators as either 'damaged' or 'healthy'. Classification accuracy is seen to vary between 65-96% and is similar whether using the frequency spectrum or ODSR. Based on the results of the laboratory testing, it is expected that this approach could be implemented on a large scale to act as an early warning tool for infrastructure owners to identify bridges presenting signs of distress or deterioration. [ABSTRACT FROM AUTHOR]

In this paper, we propose a second-order adaptive DLN algorithm with different subdomain variable time steps for the 3D closed-loop geothermal system. Theoretically, the stability and convergence of the algorithm in the case of variable time steps are analyzed. In numerical experiments, the DLN algorithm is combined with an adaptive algorithm to verify not only its effectiveness and second-order convergence under any arbitrary sequence of time steps but also to improve computational efficiency. We overcome the difficulty of 3D programming, and verify the applicability and accuracy of the proposed algorithm by simulating the flow characteristics and heat transfer of the closed-loop geothermal system with 3D convection. [ABSTRACT FROM AUTHOR]

Machine Learning and Data Mining algorithms are used extensively to enhance the performance of Intrusion Detection Systems. The number of training instances and the dimensionality of data are crucial factors affecting the performance of the model built during the training of any supervised learning algorithms. A sufficient proportion of instances having relevant features from all classes of attacks and normal traffic are considered most desirable while building the classification model that classifies the network traffic into attack and normal. This paper proposes a methodology to improve the accuracy of the model by giving importance to the relevant features that can contribute to model building. The feature selection using correlation‐based and information gain‐based techniques during training and testing contributes much to the detection of stealthier attacks and minority attacks. Then the features of the less detected attacks are identified as the second phase of the filter that is used to improve the performance. The relevant features of stealthy attacks are identified based on the correlation of corresponding features of the attack and normal data as the attacks are made stealthy mostly by making it resemble the normal traffic. Finally, the attacks that are rarely found in the training data are oversampled to improve their detection. CICIDS 2017 data set is employed as it comprises stealthier attacks generated using modern tools. NSL KDD data set is also used for evaluation to compare the proposed work with existing literature as it is used in most of the available literature. The results show superior performance with an accuracy of 99.8%, false positive rate of 0.2%, and a detection rate and 99.8%. [ABSTRACT FROM AUTHOR]

Macro‐Raman mapping is an approach that is well suited to study the distribution of molecules over a surface of typically several cm2, such as the pigment distribution on a painting. During such an experiment, thousands Raman spectra are recorded in a predefined array of points. As there can be a huge difference in Raman sensitivity between different molecules, an alternative approach is proposed, where measurement times are adapted according to the quality of the Raman scatterer. Therefore, an iterative process is implemented, involving recording short accumulations, followed by a quick evaluation. As soon as the accumulated spectrum reaches a quality criterium, measurement of the next point is started, while in the other case further accumulations are added. The influence of using multiple accumulations opposite to a single measurement for a prolonged period has been assessed by comparing the overall measurement time and the spectral intensity of the main Raman band (520.5 cm−1) of silicon. Another prerequisite for this algorithm to be successful is the need for a quick and reliable evaluation of the spectral quality. This was examined by applying this function on the accumulations of Raman spectra of 49 paint samples from a colour chart. Finally, the variable‐accumulation algorithm is applied during a macro‐Raman mapping experiment of a watercolour painting on paper. Despite a significant gain in overall measuring time, this novel approach yields a qualitative data set that can be used for creating clear Raman maps, using different data processing methods. [ABSTRACT FROM AUTHOR]

In this paper, we study the gradient descent–ascent method for convex–concave saddle-point problems. We derive a new non-asymptotic global convergence rate in terms of distance to the solution set by using the semidefinite programming performance estimation method. The given convergence rate incorporates most parameters of the problem and it is exact for a large class of strongly convex-strongly concave saddle-point problems for one iteration. We also investigate the algorithm without strong convexity and we provide some necessary and sufficient conditions under which the gradient descent–ascent enjoys linear convergence. [ABSTRACT FROM AUTHOR]

This paper proposes a retinal prosthesis edge detection (RPED) algorithm that can achieve high visual acuity and low power. Retinal prostheses have been used to stimulate retinal tissue by injecting charge via an electrode array, thereby artificially restoring the vision of visually impaired patients. The retinal prosthetic chip, which generates biphasic current pulses, should be located in the foveal area measuring 5 mm × 5 mm. When a high-density stimulation pixel array is realized in a limited area, the distance between the stimulation pixels narrows, resulting in current dispersion and high-power dissipation related to heat generation. Various edge detection methods have been proposed over the past decade to reduce these deleterious effects and achieve high-resolution pixels. However, conventional methods have the disadvantages of high-power consumption and long data processing times because many pixels are activated to detect edges. In this study, we propose a novel RPED algorithm that has a higher visual acuity and less power consumption despite using fewer active pixels than existing techniques. To verify the performance of the devised RPED algorithm, the peak signal-to-noise ratio and structural similarity index map, which evaluates the quantitative numerical value of the image are employed and compared with the Sobel, Canny, and past edge detection algorithms in MATLAB. Finally, we demonstrate the effectiveness of the proposed RPED algorithm using a 1600-pixel retinal stimulation chip fabricated using a 0.35 μm complementary metal-oxide-semiconductor process. [ABSTRACT FROM AUTHOR]

Operational amplifiers (Op-Amps) are critical to sensor systems because they enable precise, reliable, and flexible signal processing. Current automated Op-Amp generation methods suffer from extremely low efficiency because the time-consuming SPICE-in-the-loop sizing is normally involved as its inner loop. In this paper, we propose an efficiently automated Op-Amp generation tool using a hybrid sizing method, which combines the merits together from a deterministic optimization algorithm and differential evolution algorithm. Thus, it can not only quickly find a decent local optimum, but also eventually converge to a global optimum. This feature is well fit to be serving as an acute filter in the circuit structure evaluation flow to efficiently eliminate any undesirable circuit structures in advance of detailed sizing. Our experimental results demonstrate its superiority over traditional sizing approaches and show its efficacy in highly boosting the efficiency of automated Op-Amp structure generation. [ABSTRACT FROM AUTHOR]

Fixed-wing UAVs have shown great potential in both military and civilian applications. However, achieving safe and collision-free flight in complex obstacle environments is still a challenging problem. This paper proposed a hierarchical two-layer fixed-wing UAV motion planning algorithm based on a global planner and a local reinforcement learning (RL) planner in the presence of static obstacles and other UAVs. Considering the kinematic constraints, a global planner is designed to provide reference guidance for ego-UAV with respect to static obstacles. On this basis, a local RL planner is designed to accomplish kino-dynamic feasible and collision-free motion planning that incorporates dynamic obstacles within the sensing range. Finally, in the simulation training phase, a multi-stage, multi-scenario training strategy is adopted, and the simulation experimental results show that the performance of the proposed algorithm is significantly better than that of the baseline method. [ABSTRACT FROM AUTHOR]

Aiming at the problems of the poor robustness and universality of traditional contour matching algorithms in engineering applications, a method for improving the surface defect detection of industrial products based on contour matching algorithms is detailed in this paper. Based on the image pyramid optimization method, a three-level matching method is designed, which can quickly obtain the candidate pose of the target contour at the top of the image pyramid, combining the integral graph and the integration graph acceleration strategy based on weak classification. It can quickly obtain the rough positioning and rough angle of the target contour, which greatly improves the performance of the algorithm. In addition, to solve the problem that a large number of duplicate candidate points will be generated when the target candidate points are expanded, a method to obtain the optimal candidate points in the neighborhood of the target candidate points is designed, which can guarantee the matching accuracy and greatly reduce the calculation amount. In order to verify the effectiveness of the algorithm, functional test experiments were designed for template building function and contour matching function, including uniform illumination condition, nonlinear condition and contour matching detection under different conditions. The results show that: (1) Under uniform illumination conditions, the detection accuracy can be maintained at about 93%. (2) Under nonlinear illumination conditions, the detection accuracy can be maintained at about 91.84%. (3) When there is an external interference source, there will be a false detection or no detection, and the overall defect detection rate remains above 94%. It is verified that the proposed method can meet the application requirements of common defect detection, and has good robustness and meets the expected functional requirements of the algorithm, providing a strong technical guarantee and data support for the design of embedded image sensors in the later stage. [ABSTRACT FROM AUTHOR]

For the RRT* algorithm, there are problems such as greater randomness, longer time consumption, more redundant nodes, and inability to perform local obstacle avoidance when encountering unknown obstacles in the path planning process of autonomous vehicles. And the artificial potential field method (APF) applied to autonomous vehicles is prone to problems such as local optimality, unreachable targets, and inapplicability to global scenarios. A fusion algorithm combining the improved RRT* algorithm and the improved artificial potential field method is proposed. First of all, for the RRT* algorithm, the concept of the artificial potential field and probability sampling optimization strategy are introduced, and the adaptive step size is designed according to the road curvature. The path post-processing of the planned global path is carried out to reduce the redundant nodes of the generated path, enhance the purpose of sampling, solve the problem where oscillation may occur when expanding near the target point, reduce the randomness of RRT* node sampling, and improve the efficiency of path generation. Secondly, for the artificial potential field method, by designing obstacle avoidance constraints, adding a road boundary repulsion potential field, and optimizing the repulsion function and safety ellipse, the problem of unreachable targets can be solved, unnecessary steering in the path can be reduced, and the safety of the planned path can be improved. In the face of U-shaped obstacles, virtual gravity points are generated to solve the local minimum problem and improve the passing performance of the obstacles. Finally, the fusion algorithm, which combines the improved RRT* algorithm and the improved artificial potential field method, is designed. The former first plans the global path, extracts the path node as the temporary target point of the latter, guides the vehicle to drive, and avoids local obstacles through the improved artificial potential field method when encountered with unknown obstacles, and then smooths the path planned by the fusion algorithm, making the path satisfy the vehicle kinematic constraints. The simulation results in the different road scenes show that the method proposed in this paper can quickly plan a smooth path that is more stable, more accurate, and suitable for vehicle driving. [ABSTRACT FROM AUTHOR]

The annotation of magnetic resonance imaging (MRI) images plays an important role in deep learning-based MRI segmentation tasks. Semi-automatic annotation algorithms are helpful for improving the efficiency and reducing the difficulty of MRI image annotation. However, the existing semi-automatic annotation algorithms based on deep learning have poor pre-annotation performance in the case of insufficient segmentation labels. In this paper, we propose a semi-automatic MRI annotation algorithm based on semi-weakly supervised learning. In order to achieve a better pre-annotation performance in the case of insufficient segmentation labels, semi-supervised and weakly supervised learning were introduced, and a semi-weakly supervised learning segmentation algorithm based on sparse labels was proposed. In addition, in order to improve the contribution rate of a single segmentation label to the performance of the pre-annotation model, an iterative annotation strategy based on active learning was designed. The experimental results on public MRI datasets show that the proposed algorithm achieved an equivalent pre-annotation performance when the number of segmentation labels was much less than that of the fully supervised learning algorithm, which proves the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Atrial fibrillation (AF) is a common arrhythmia, and out-of-hospital, wearable, long-term electrocardiogram (ECG) monitoring can help with the early detection of AF. The presence of a motion artifact (MA) in ECG can significantly affect the characteristics of the ECG signal and hinder early detection of AF. Studies have shown that (a) using reference signals with a strong correlation with MAs in adaptive filtering (ADF) can eliminate MAs from the ECG, and (b) artificial intelligence (AI) algorithms can recognize AF when there is no presence of MAs. However, no literature has been reported on whether ADF can improve the accuracy of AI for recognizing AF in the presence of MAs. Therefore, this paper investigates the accuracy of AI recognition for AF when ECGs are artificially introduced with MAs and processed by ADF. In this study, 13 types of MA signals with different signal-to-noise ratios ranging from +8 dB to −16 dB were artificially added to the AF ECG dataset. Firstly, the accuracy of AF recognition using AI was obtained for a signal with MAs. Secondly, after removing the MAs by ADF, the signal was further identified using AI to obtain the accuracy of the AF recognition. We found that after undergoing ADF, the accuracy of AI recognition for AF improved under all MA intensities, with a maximum improvement of 60%. [ABSTRACT FROM AUTHOR]

Within research on the cross-view geolocation of UAVs, differences in image sources and interference from similar scenes pose huge challenges. Inspired by multimodal machine learning, in this paper, we design a single-stream pyramid transformer network (SSPT). The backbone of the model uses the self-attention mechanism to enrich its own internal features in the early stage and uses the cross-attention mechanism in the later stage to refine and interact with different features to eliminate irrelevant interference. In addition, in the post-processing part of the model, a header module is designed for upsampling to generate heat maps, and a Gaussian weight window is designed to assign label weights to make the model converge better. Together, these methods improve the positioning accuracy of UAV images in satellite images. Finally, we also use style transfer technology to simulate various environmental changes in order to expand the experimental data, further proving the environmental adaptability and robustness of the method. The final experimental results show that our method yields significant performance improvement: The relative distance score (RDS) of the SSPT-384 model on the benchmark UL14 dataset is significantly improved from 76.25% to 84.40%, while the meter-level accuracy (MA) of 3 m, 5 m, and 20 m is increased by 12%, 12%, and 10%, respectively. For the SSPT-256 model, the RDS has been increased to 82.21%, and the meter-level accuracy (MA) of 3 m, 5 m, and 20 m has increased by 5%, 5%, and 7%, respectively. It still shows strong robustness on the extended thermal infrared (TIR), nighttime, and rainy day datasets. [ABSTRACT FROM AUTHOR]

Simple Summary: Breast cancer is a significant cause of female cancer-related deaths in the US. Checking how severe the cancer is helps in planning treatment. Modern AI methods are good at grading cancer, but they are not used much in hospitals yet. We developed and utilized ensemble deep learning algorithms for addressing the tasks of classifying (1) breast cancer subtype and (2) breast cancer invasiveness from whole slide image (WSI) histopathology slides. The ensemble models used were based on convolutional neural networks (CNNs) known for extracting distinctive features crucial for accurate classification. In this paper, we provide a comprehensive analysis of these models and the used methodology for breast cancer diagnosis tasks. Cancer diagnosis and classification are pivotal for effective patient management and treatment planning. In this study, a comprehensive approach is presented utilizing ensemble deep learning techniques to analyze breast cancer histopathology images. Our datasets were based on two widely employed datasets from different centers for two different tasks: BACH and BreakHis. Within the BACH dataset, a proposed ensemble strategy was employed, incorporating VGG16 and ResNet50 architectures to achieve precise classification of breast cancer histopathology images. Introducing a novel image patching technique to preprocess a high-resolution image facilitated a focused analysis of localized regions of interest. The annotated BACH dataset encompassed 400 WSIs across four distinct classes: Normal, Benign, In Situ Carcinoma, and Invasive Carcinoma. In addition, the proposed ensemble was used on the BreakHis dataset, utilizing VGG16, ResNet34, and ResNet50 models to classify microscopic images into eight distinct categories (four benign and four malignant). For both datasets, a five-fold cross-validation approach was employed for rigorous training and testing. Preliminary experimental results indicated a patch classification accuracy of 95.31% (for the BACH dataset) and WSI image classification accuracy of 98.43% (BreakHis). This research significantly contributes to ongoing endeavors in harnessing artificial intelligence to advance breast cancer diagnosis, potentially fostering improved patient outcomes and alleviating healthcare burdens. [ABSTRACT FROM AUTHOR]

The aim of this paper is to propose efficient algorithms for computing the energetic lower bounds of the cumulative sheduling problem. So we have to schedule in a minimal makespan a set of non preemptive tasks on a resource with a given capacity. A task has a release date, a processing time and a tail and requires a given amount of the resource capacity during its processing. The energetic lower bound is the largest value of the makespan such that the energetic reasoning check cannot detect unfeasability. We report some algorithms to practically compute this lower bound with efficient complexity. These algorithms rely on iterative augmentations of C max until the cumulative constraint or the energetic constraint is satisfied. Our Computational results show their practical efficiencies. [ABSTRACT FROM AUTHOR]

In this paper, based on the Lagrange multiplier method, we construct a maximum principle preserving scheme for the time-fractional Allen-Cahn equation of 2- α (0 < α < 1) order. The correction energy of this scheme is increased by a term compared to the original energy, which is O (τ α). We prove that our scheme is unconditionally stable related to the corrected energy and verify the convergence, maximum principle, and energy conservation properties of the algorithm through numerical examples. We also find that the larger the α , the faster the evolution of the time-fractional Allen-Cahn equation. [ABSTRACT FROM AUTHOR]

In quantum computing there are quite a few universal gate sets, each having their own characteristics. In this paper we study the Clifford+CS universal fault-tolerant gate set. The CS gate is used is many applications and this gate set is an important alternative to Clifford+T. We introduce a generating set in order to represent any unitary implementable by this gate set and with this we derive a bound on the CS-count of arbitrary multi-qubit unitaries. Analysing the channel representation of the generating set elements, we infer J n CS ⊂ J n T , where J n CS and J n T are the set of unitaries exactly implementable by the Clifford+CS and Clifford+T gate sets, respectively. We develop CS-count optimal synthesis algorithms for both approximately and exactly implementable multi-qubit unitaries. With the help of these we derive a CS-count-optimal circuit for Toffoli, implying J n Tof = J n CS , where J n Tof is the set of unitaries exactly implementable by the Clifford+Toffoli gate set. Such conclusions can have an important impact on resource estimates of quantum algorithms. [ABSTRACT FROM AUTHOR]

The paper studies a presynchronization control of grid connection for large merchant marine microgrid inverters. We present a virtual synchronous generator (VSG) algorithm with model-free adaptive control (MFAC) to optimize the stable grid connection of ship microgrid and shore-to-ship power. To solve poor precision of presynchronization control under nonideal ship microgrid condition, an MFAC controller and its presynchronization method are developed for grid connection of ship-distributed generation inverters. The proposed presynchronization control method effectively avoids a high transient overcurrent and achieves a seamless grid connection to different types of shore power. The simulation results verify the effectiveness of the proposed control method. [ABSTRACT FROM AUTHOR]

Time series data complexity presents new challenges in clustering analysis across fields such as electricity, energy, industry, and finance. Despite advances in representation learning and clustering with Variational Autoencoders (VAE) based deep learning techniques, issues like the absence of discriminative power in feature representation, the disconnect between instance reconstruction and clustering objectives, and scalability challenges with large datasets persist. This paper introduces a novel deep time series clustering approach integrating VAE with metric learning. It leverages a VAE based on Gated Recurrent Units for temporal feature extraction, incorporates metric learning for joint optimization of latent space representation, and employs the sum of log likelihoods as the clustering merging criterion, markedly improving clustering accuracy and interpretability. Experimental findings demonstrate a 27.16% improvement in average clustering accuracy and a 47.15% increase in speed on industrial load data. This study offers novel insights and tools for the thorough analysis and application of time series data, with further exploration of VAE's potential in time series clustering anticipated in future research. [ABSTRACT FROM AUTHOR]

This paper proposes a novel multi-hybrid algorithm named DHPN, using the best-known properties of dwarf mongoose algorithm (DMA), honey badger algorithm (HBA), prairie dog optimizer (PDO), cuckoo search (CS), grey wolf optimizer (GWO) and naked mole rat algorithm (NMRA). It follows an iterative division for extensive exploration and incorporates major parametric enhancements for improved exploitation operation. To counter the local optima problems, a stagnation phase using CS and GWO is added. Six new inertia weight operators have been analyzed to adapt algorithmic parameters, and the best combination of these parameters has been found. An analysis of the suitability of DHPN towards population variations and higher dimensions has been performed. For performance evaluation, the CEC 2005 and CEC 2019 benchmark data sets have been used. A comparison has been performed with differential evolution with active archive (JADE), self-adaptive DE (SaDE), success history based DE (SHADE), LSHADE-SPACMA, extended GWO (GWO-E), jDE100, and others. The DHPN algorithm is also used to solve the image fusion problem for four fusion quality metrics, namely, edge-based similarity index ( Q A B / F ), sum of correlation difference (SCD), structural similarity index measure (SSIM), and artifact measure ( N A B / F ). The average Q A B / F = 0.765508 , S C D = 1.63185 , S S I M = 0.726317 , and N A B / F = 0.006617 shows the best combination of results obtained by DHPN with respect to the existing algorithms such as DCH, CBF, GTF, JSR and others. Experimental and statistical Wilcoxon's and Friedman's tests show that the proposed DHPN algorithm performs significantly better in comparison to the other algorithms under test. [ABSTRACT FROM AUTHOR]

With the rapid development of intelligent connected vehicles, there is an increasing demand for hardware facilities and onboard systems of driver assistance systems. Currently, most vehicles are constrained by the hardware resources of onboard systems, which mainly process single-task and single-sensor data. This poses a significant challenge in achieving complex panoramic driving perception technology. While the panoramic driving perception algorithm YOLOP has achieved outstanding performance in multi-task processing, it suffers from poor adaptability of feature map pooling operations and loss of details during downsampling. To address these issues, this paper proposes a panoramic driving perception fusion algorithm based on multi-task learning. The model training involves the introduction of different loss functions and a series of processing steps for lidar point cloud data. Subsequently, the perception information from lidar and vision sensors is fused to achieve synchronized processing of multi-task and multi-sensor data, thereby effectively improving the performance and reliability of the panoramic driving perception system. To evaluate the performance of the proposed algorithm in multi-task processing, the BDD100K dataset is used. The results demonstrate that, compared to the YOLOP model, the multi-task learning network performs better in lane detection, drivable area detection, and vehicle detection tasks. Specifically, the lane detection accuracy improves by 11.6%, the mean Intersection over Union (mIoU) for drivable area detection increases by 2.1%, and the mean Average Precision at 50% IoU (mAP50) for vehicle detection improves by 3.7%. [ABSTRACT FROM AUTHOR]

Accurate positioning in space is an important foundation for ensuring the stability of autonomous flight and successful mapping and navigation of unmanned aerial vehicles (UAVs). At present, the SLAM algorithm based on the Cartographer algorithm for real-time positioning and mapping is widely used in fields such as robot navigation and autonomous driving. However, in the context of UAV applications, this algorithm has a high dependence on the amount of point cloud information in the surrounding environment, and cannot achieve precise positioning in open spaces with insufficient lighting and fewer feature points, resulting in significant mapping errors. In order to solve the problem of low positioning estimation accuracy in the Cartographer algorithm in above environment, this paper proposes a precise positioning algorithm for UAVs that integrates VIO and Cartographer. This algorithm can continuously output more accurate position estimation information during UAV flight, compensating for the problem of inaccurate position estimation caused by partial feature loss or coordinate system drift in point clouds. In addition, this algorithm ensures navigation obstacle avoidance in narrow spaces by improving positioning accuracy and mapping accuracy, making it more applicable in the field of UAVs. Finally, the effectiveness of the proposed positioning algorithm was verified through experimental analysis of the Cartographer dataset and practical testing of UAVs in real scenarios. [ABSTRACT FROM AUTHOR]

The main objective of this paper is to consider a discrete data assimilation algorithm for the three dimensional planetary geostrophic equations of large-scale ocean circulation in the case that the observable measurements, obtained discretely in time, may be contaminated by systematic errors, which works for a general class of observable measurements, such as low Fourier modes and local spatial averages over finite volume elements. We will provide some suitable conditions to establish asymptotic in time estimates of the difference between the approximating solution and the unknown exact (reference) solution in some appropriate norms for these two different kinds of interpolation operators, which also shows that the approximation solution of the proposed discrete data assimilation algorithm will convergent to the unique unknown exact (reference) solution of the original system at an exponential rate, asymptotically in time if the observational measurements are free of error. [ABSTRACT FROM AUTHOR]

Physics-informed neural networks (PINNs) have garnered widespread use for solving a variety of complex partial differential equations (PDEs). Nevertheless, when addressing certain specific problem types, traditional sampling algorithms still reveal deficiencies in efficiency and precision. In response, this paper builds upon the progress of adaptive sampling techniques, addressing the inadequacy of existing algorithms to fully leverage the spatial location information of sample points, and introduces an innovative adaptive sampling method. This approach incorporates the Dual Inverse Distance Weighting (DIDW) algorithm, embedding the spatial characteristics of sampling points within the probability sampling process. Furthermore, it introduces reward factors derived from reinforcement learning principles to dynamically refine the probability sampling formula. This strategy more effectively captures the essential characteristics of PDEs with each iteration. We utilize sparsely connected networks and have adjusted the sampling process, which has proven to effectively reduce the training time. In numerical experiments on fluid mechanics problems, such as the two-dimensional Burgers' equation with sharp solutions, pipe flow, flow around a circular cylinder, lid-driven cavity flow, and Kovasznay flow, our proposed adaptive sampling algorithm markedly enhances accuracy over conventional PINN methods, validating the algorithm's efficacy. [ABSTRACT FROM AUTHOR]

The sine cosine algorithm (SCA) and multi-verse optimizer (MVO) are the recognized optimization strategies frequently employed in numerous scientific areas. However, both SCA and MVO grapple with optimizing the transition between the exploitation and exploration mechanisms. Furthermore, MVO exhibits constraints in its exploitation capabilities. To tackle these limitations, this paper introduces a hybrid model termed SMVO, combining the advantages of both SCA and MVO. This hybrid approach seeks to harmonize exploitation and exploration stages by leveraging the unique advantages of each parent algorithm. The efficacy of SMVO was assessed using 23 benchmark test functions, revealing its competitive performance against not only SCA and MVO but also the ant lion optimization (ALO) and the dragonfly algorithm (DA). Additionally, SMVO's applicability was further validated by successfully addressing three distinct engineering optimization challenges, underscoring its stability and promise as a global optimization tool. [ABSTRACT FROM AUTHOR]

This paper presents a novel hybrid algorithm based on CMOGWO-ADNSGA-II to solve the vibration stability problem during the operation of a EMS-type maglev train dynamics model subjected to strong non-linear magnetic buoyancy. The proposed algorithm optimizes the control system parameters of EMS-type maglev train suspensions by combining an improved multi-objective chaotic grey wolf algorithm (CMOGWO) with an improved non-dominated Sorting genetic algorithm-II (ADNSGA-II) to enhance the search capability of the algorithm and ensure population diversity. The efficacy of the algorithm is demonstrated by applying it to the EMS-type maglev train suspension frame control system to find the optimal control parameters. Experimental results show that the system with the optimal parameters applied significantly reduces the suspension gap amplitude and the corresponding standard deviation, as well as the vertical acceleration amplitude and the corresponding standard deviation during operation. The proposed algorithm provides a good solution for EMS-type maglev train suspension vibration control, which can improve its performance and safety. [ABSTRACT FROM AUTHOR]

This paper proposes a new algorithm based on sensitivity analysis and the Wolfe method to solve a sequence of parametric quadratic programming (QP) problems such as those that arise in quadratic model predictive control (QMPC). The Wolfe method, based on Karush–Kuhn–Tucker conditions, has been used to convert parametric QP problems to parametric linear programming (LP) problems, and then the sensitivity analysis is applied to solve the sequence of the parametric LP problems. This strategy obtains sensitivity analysis‐based QMPC (SA‐QMPC) algorithm. It is proved that the computational complexity of SA‐QMPC is O(Nn2)$O(Nn^2)$ for a region of the initial conditions and O(N2n2)$O(N^2n^2)$ for sufficiently small sampling time and all initial conditions, where N$N$ and n$n$ are the horizon time and dimension of the state vector, respectively. Numerical results indicate the potential and properties of the proposed algorithm. [ABSTRACT FROM AUTHOR]