Previous Algorithms Research Articles

Faults locating of power distribution systems based on successive PSO-GA algorithm

As the terminal of the power system, the distribution network is the main area where failures occur. In addition, with the integration of distributed generation, the traditional distribution network becomes more complex, rendering the conventional fault location algorithms based on a single power supply obsolete. Therefore, it is necessary to seek a new algorithm to locate the fault of the distributed power distribution network. In existing fault localization algorithms for distribution networks, since there are only two states of line faults, which can usually be represented by 0 and 1, most algorithms use discrete algorithms with this characteristic for iterative optimization. Therefore, this paper combines the advantages of the particle swarm algorithm and genetic algorithm and uses continuous real numbers for iteration to construct a successive particle swarm genetic algorithm (SPSO-GA) different from previous algorithms. The accuracy, speed, and fault tolerance of SPSO-GA, discrete particle swarm Genetic algorithm, and artificial fish swarm algorithm are compared in an IEEE33-node distribution network with the distributed power supply. The simulation results show that the SPSO-GA algorithm has high optimization accuracy and stability for single, double, or triple faults. Furthermore, SPSO-GA has a rapid convergence velocity, requires fewer particles, and can locate the fault segment accurately for the distribution network containing distorted information.

MCF-YOLOv5: A Small Target Detection Algorithm Based on Multi-Scale Feature Fusion Improved YOLOv5

In recent years, many deep learning-based object detection methods have performed well in various applications, especially in large-scale object detection. However, when detecting small targets, previous object detection algorithms cannot achieve good results due to the characteristics of the small targets themselves. To address the aforementioned issues, we propose the small object algorithm model MCF-YOLOv5, which has undergone three improvements based on YOLOv5. Firstly, a data augmentation strategy combining Mixup and Mosaic is used to increase the number of small targets in the image and reduce the interference of noise and changes in detection. Secondly, in order to accurately locate the position of small targets and reduce the impact of unimportant information on small targets in the image, the attention mechanism coordinate attention is introduced in YOLOv5’s neck network. Finally, we improve the Feature Pyramid Network (FPN) structure and add a small object detection layer to enhance the feature extraction ability of small objects and improve the detection accuracy of small objects. The experimental results show that, with a small increase in computational complexity, the proposed MCF-YOLOv5 achieves better performance than the baseline on both the VisDrone2021 dataset and the Tsinghua Tencent100K dataset. Compared with YOLOv5, MCF-YOLOv5 has improved detection APsmall by 3.3% and 3.6%, respectively.

An unstructured body-of-revolution electromagnetic particle-in-cell algorithm with radial perfectly matched layers and dual polarizations

A novel electromagnetic particle-in-cell algorithm has been developed for fully kinetic plasma simulations on unstructured (irregular) meshes in complex body-of-revolution geometries. The algorithm, implemented in the BORPIC++ code, utilizes a set of field scalings and a coordinate mapping, reducing the Maxwell field problem in a cylindrical system to a Cartesian finite element Maxwell solver in the meridian plane. The latter obviates the cylindrical coordinate singularity in the symmetry axis. The choice of an unstructured finite element discretization enhances the geometrical flexibility of the BORPIC++ solver compared to the more traditional finite difference solvers. Symmetries in Maxwell's equations are explored to decompose the problem into two dual polarization states with isomorphic representations that enable code reuse. The particle-in-cell scatter and gather steps preserve charge-conservation at the discrete level. Our previous algorithm (BORPIC+) discretized the E and B field components of TEϕ and TMϕ polarizations on the finite element (primal) mesh [1,2]. Here, we employ a new field-update scheme. Using the same finite element (primal) mesh, this scheme advances two sets of field components independently: (1) E and B of TEϕ polarized fields, (Ez,Eρ,Bϕ) and (2) D and H of TMϕ polarized fields, (Dϕ,Hz,Hρ). Since these field updates are not explicitly coupled, the new field solver obviates the coordinate singularity, which otherwise arises at the cylindrical symmetric axis, ρ=0 when defining the discrete Hodge matrices (generalized finite element mass matrices). A cylindrical perfectly matched layer is implemented as a boundary condition in the radial direction to simulate open space problems, with periodic boundary conditions in the axial direction. We investigate effects of charged particles moving next to the cylindrical perfectly matched layer. We model azimuthal currents arising from rotational motion of charged rings, which produce TMϕ polarized fields. Several numerical examples are provided to illustrate the first application of the algorithm.

M[formula omitted]ixKG: Mixing for harder negative samples in knowledge graph

Knowledge graph embedding (KGE) involves mapping entities and relations to low-dimensional dense embeddings, enabling a wide range of real-world applications. The mapping is achieved via distinguishing the positive and negative triplets in knowledge graphs. Therefore, how to design high-quality negative triplets is critical in the effectiveness of KEG models. Existing KGE models face challenges in generating high-quality negative triplets. Some models employ simple static distributions, i.e. uniform or Bernoulli distribution, and it is difficult for these methods to be trained distinguishably because of the sampled uninformative negative triplets. Furthermore, current methods are confined to constructing negative triplets from existing entities within the knowledge graph, limiting their ability to explore harder negatives. We introduce a novel mixing strategy in knowledge graphs called M2ixKG. M2ixKG adopts mixing operation in generating harder negative samples from two aspects: one is mixing among the heads and tails in triplets with the same relation to strengthen the robustness and generalization of the entity embeddings; the other is mixing the negatives with high scores to generate harder negatives. Our experiments, utilizing three datasets and four classical score functions, highlight the exceptional performance of M2ixKG in comparison to previous negative sampling algorithms.

Optimizing time and cost in construction projects with a hybridized multi-verse optimizer and opposition-based learning

PurposeFor successful management of construction projects, a precise analysis of the balance between time and cost is imperative to attain the most effective results. The aim of this study is to present an innovative approach tailored to tackle the challenges posed by time-cost trade-off (TCTO) problems. This objective is achieved through the integration of the multi-verse optimizer (MVO) with opposition-based learning (OBL), thereby introducing a groundbreaking methodology in the field.Design/methodology/approachThe paper aims to develop a new hybrid meta-heuristic algorithm. This is achieved by integrating the MVO with OBL, thereby forming the iMVO algorithm. The integration enhances the optimization capabilities of the algorithm, notably in terms of exploration and exploitation. Consequently, this results in expedited convergence and yields more accurate solutions. The efficacy of the iMVO algorithm will be evaluated through its application to four different TCTO problems. These problems vary in scale – small, medium and large – and include real-life case studies that possess complex relationships.FindingsThe efficacy of the proposed methodology is evaluated by examining TCTO problems, encompassing 18, 29, 69 and 290 activities, respectively. Results indicate that the iMVO provides competitive solutions for TCTO problems in construction projects. It is observed that the algorithm surpasses previous algorithms in terms of both mean deviation percentage (MD) and average running time (ART).Originality/valueThis research represents a significant advancement in the field of meta-heuristic algorithms, particularly in their application to managing TCTO in construction projects. It is noteworthy for being among the few studies that integrate the MVO with OBL for the management of TCTO in construction projects characterized by complex relationships.

Proposing a new control method for active stabilizer bars using an intelligent self-learning algorithm

This article’s main content is directed toward designing and applying a new control algorithm for automotive stabilizer bars. Previous studies often only used classical control algorithms or simple fuzzy algorithms to control hydraulic anti-roll systems on cars based on safety criteria. In this article, a self-learning algorithm (ANFIS) is established based on inheriting the advantages of previous algorithms. Additionally, this algorithm is modified and improved to increase the convergence of the results after the end of the steering process. Simulations show that when the self-learning solution is applied to active anti-roll bars, the roll angle value and the attenuation of the vertical force at wheels decrease significantly. In complex motion conditions (second case, v3), rollover occurs if the automobile does not have an anti-roll bar. However, roll stability and road holding ability are always ensured when applying the ANFIS algorithm to control active anti-roll bars. According to these findings, the minimum value of the vertical force at the rear wheel can be up to 1384.02 N even when the car is traveling in extremely harsh conditions (second case, v4). In addition, the response speed and convergence of values are always well-controlled when the intelligent self-learning algorithm is applied to the anti-roll control system.

MULTI-TASK crow swarm-intelligent algorithm for enhancing spectrum efficiency and energy conservation in cognitive radio ad-hoc networking

Cognitive Radio Ad-hoc Networking (CRAHN) could unlicensed users access neglected spectrum assets. This research offers an innovative Multi-task Crow Swarm-Intelligent (MCSI) methodology for ensuring the effective usage of spectrum and the preservation of energy in CRAHN. The suggested method uses a crow-inspired swarm's collective cognition to maximize the distribution of spectrum assets, adjust to shifting network circumstances, and consume energy as possible. We covered the important factors that influence spectrum effectiveness, like the population of the swarm, the sensor's threshold measurement, and the optimum amount of iterations, underscoring the significance of finding the right mix of these factors. In comparison to previous algorithms, this work gives a thorough evaluation of MCSI using simulated tests, highlighting its outstanding results with regard to spectrum effectiveness and preserving energy. The results suggest that MCSI combines spectrum use and energy savings, making it a promising CRAHN performance technology.

A simple and efficient Distributed Trigger Counting algorithm based on local thresholds

Consider a large-scale distributed system in which each computing device is observing triggers from an external source. Distributed Trigger Counting (DTC) algorithm is used to detect the state of the system when the aggregated number of the observed triggers reaches a predefined value. In this paper, we propose a simple and efficient DTC algorithm: Cascading Thresholds (CT). We mathematically show that CT is an optimal DTC algorithm in terms of the total number of exchanged messages among the devices (message complexity). For the maximum number of received messages per device (MaxRcv), CT is sub-optimal. The average message complexity of CT is O(Nlog(W/N)), and MaxRcv of it is O(klog(W/N)+N), where W is the number of triggers to be detected, N is the number of devices, and k is the degree of a node in the tree-like structure. Compared to the previous optimal algorithm (TreeFill), CT is much simpler: in our implementation the code size is about 2.5 times smaller. Also, unlike TreeFill CT does not require complicated mechanisms including distributed locking. Experimental results show that CT has a lower message complexity and MaxRcv compared to the previous work (CoinRand and RingRand). Furthermore, CT and TreeFill show a similar performance. From its simplicity, CT is more practical than previous work including TreeFill, CoinRand and RingRand.

Robust Adaptive Control Based on Incremental Nonlinear Dynamic Inversion for a Quadrotor in Presence of Partial Actuator Fault

This paper presents a novel nonlinear robust adaptive trajectory tracking control architecture for stabilizing and controlling a quadrotor in the presence of actuator partial faults. The proposed control strategy utilizes an Incremental Nonlinear Dynamic Inversion (INDI) algorithm as the baseline controller in the inner loop and augments a nonlinear model reference adaptive controller in the outer loop to ensure robustness against unmodeled faults. Additionally, a modified PID controller is introduced in the most outer-loop to track the desired path. The effects of actuator faults are modeled by considering sudden variations in motor thrust and torques. To enhance the control algorithm's robustness, a projection operator is employed in the robust adaptive structure. Comparative performance evaluations with a previous successful algorithm implemented on a quadrotor model demonstrate that the proposed controller achieves full controllability of the faulty quadrotor in pitch, roll, and yaw channels in the presence of actuator partial faults up to 50%.

Increasing SAR Imaging Precision for Burden Surface Profile Jointly Using Low-Rank and Sparsity Priors

The synthetic aperture radar (SAR) imaging technique for a frequency-modulated continuous wave (FMCW) has attracted wide attention in the field of burden surface profile measurement. However, the imaging data are virtually under-sampled due to the severely restricted scan time, which prevents the antenna being exposed to high temperatures and heavy dust in the blast furnace (BF) for an extended period. In traditional SAR imaging algorithm research, the insufficient accumulation of scattered energy in reconstructing the burden surface profile leads to lower imaging precision, and the harsh smelting increases the probability of distortion in shape detection. In this study, to address these challenges, a novel rotating SAR imaging algorithm based on the constructed mechanical swing radar system is proposed. This algorithm is inspired by the low-rank property of the sampled signal matrix and the sparsity of burden surface profile images. First, the sparse FMCW signal is modeled, and the position transform matrix, calculated according to the BF dimensions, is embedded into the dictionary matrix. Then, the low-rank and sparsity priors are considered and reformulated as split variables in order to establish a convex optimization problem. Lastly, the augmented Lagrange multiplier (ALM) is employed to solve this problem under double constraints, and the imaging results are obtained using the alternating direction method of multipliers (ADMM). The experimental results demonstrate that, in the subsequent shape detection, the root mean square error (RMSE) is 15.38% lower than the previous algorithm and 15.63% lower under low signal-to-noise (SNR) conditions. In both enclosed and harsh environments, the proposed algorithm is able to achieve higher imaging precision even under high noise. It will be further optimized for speed and reliability, with plans to extend its application to 3D measurements in the future.

Analyzing the impact of Jakarta’s reclamation on the distribution of TSS using remote sensing technology

Jakarta Bay is a bay supporting the economy of thousands of nearby fishermen. Therefore, the reclamation in Jakarta Bay raises many environmental, economic, and social problems. During this reclamation, dredging and stockpiling activities increase the turbidity of the waters. This research aims to determine the changes in the distribution of total suspended solids (TSS) after reclamation using Sentinel 2A satellite imagery from 2016 to 2022. This research implemented the previous algorithm to produce the distribution of TSS in Jakarta Bay for attaining TSS values from Sentinel 2A satellite imagery processed by Google Earth Engine with overlay analysis method in a geographic information system. Spatial data were obtained by extracting TSS values using the previous estimation algorithm, namely the Budhiman algorithm, with a correlation coefficient of -0.745 and NMAE of 0.167. Based on the data processing results, it was found that the distribution of TSS from 2016 to 2022 was at a moderate level, which had a relatively significant influence on fisheries, requiring the fishermen to go to the open sea farther from the coast. This shows that reclamation carries no impact on the life of marine biota in Jakarta Bay.

Enhancement of Brain Computer Interface System Based on Artificial Intelligent Technique

With the rapid development of information technology, the EEG has become an increasingly popular method for analyzing brain signals. EEG signals greatly contribute to(BCI) brain-computer communication . BCI outputs are used to restore many functions in relation to individuals with a motor impairment, and these signals are complex random signals produced from hundreds of millions of neurons in EEG mixtures in the brain that contain many data about brain activity. its include artefacts which have a great influence on the diagnosis; Hence, these unwanted signals become the most important problem in EEG signal analysis. Therefore, used four blind source separation techniques (BSS), STONE, FICA, BEFICA and EFICA. The proposed system is using one of the new Antlion (ALO) optimization algorithms to improve the performance of the previous algorithms and find out which ones are the most responsive, by comparing them and choosing the best ones according to the (PSD) standard. With the use of real data, noticed through the results that the EFICA algorithm is the best response to the improvement and the most efficient, as the ratio of (PSD) was the least possible, as ALO worked to reduce thevariance in the distribution of the frequency spectrum because it relied on solving constrained problems using various searches.

A Novel Feature Engineering-Based SOH Estimation Method for Lithium-Ion Battery with Downgraded Laboratory Data

Accurate estimation of lithium-ion battery state of health (SOH) can effectively improve the operational safety of electric vehicles and optimize the battery operation strategy. However, previous SOH estimation algorithms developed based on high-precision laboratory data have ignored the discrepancies between field and laboratory data, leading to difficulties in field application. Therefore, aiming to bridge the gap between the lab-developed models and the field operational data, this paper presents a feature engineering-based SOH estimation method with downgraded laboratory battery data, applicable to real vehicles under different operating conditions. Firstly, a data processing pipeline is proposed to downgrade laboratory data to operational fleet-level data. The six key features are extracted on the partial ranges to capture the battery’s aging state. Finally, three machine learning (ML) algorithms for easy online deployment are employed for SOH assessment. The results show that the hybrid feature set performs well and has high accuracy in SOH estimation for downgraded data, with a minimum root mean square error (RMSE) of 0.36%. Only three mechanism features derived from the incremental capacity curve can still provide a proper assessment, with a minimum RMSE of 0.44%. Voltage-based features can assist in evaluating battery state, improving accuracy by up to 20%.

Enhancing cross-market recommendations by addressing negative transfer and leveraging item co-occurrences

Real-world multinational e-commerce companies, such as Amazon and eBay, serve in multiple countries and regions. Some markets are data-scarce, while others are data-rich. In recent years, cross-market recommendation (CMR) has been proposed to bolster data-scarce markets by leveraging auxiliary information from data-rich markets. Previous CMR algorithms have employed techniques such as sharing market-agnostic parameters or incorporating inter-market similarity to optimize the performance of CMR. However, the existing approaches have several limitations: (1) They do not fully utilize the valuable information on item co-occurrences obtained from data-rich markets (such as the consistent purchase of mice and keyboards). (2) They ignore the issue of negative transfer stemming from disparities across diverse markets. To address these limitations, we introduce a novel attention-based model that exploits users’ historical behaviors to mine general patterns from item co-occurrences and designs market-specific embeddings to mitigate negative transfer. Specifically, we propose an attention-based user interest mining module to harness the potential of common items as bridges for mining general knowledge from item co-occurrence patterns through rich data derived from global markets. In order to mitigate the adverse effects of negative transfer, we decouple the item representations into market-specific embeddings and market-agnostic embeddings. The market-specific embeddings effectively model the inherent biases associated with different markets, while the market-agnostic embeddings learn generic representations of the items. Extensive experiments conducted on seven real-world datasets illustrate our model’s effectiveness.11Our codes and checkpoints are available at https://github.com/laowangzi/ACMR. Our model outperforms the suboptimal model by an average of 4.82%, 6.82%, 3.87%, and 5.34% across four variants of two metrics. Extensive experiments and analysis demonstrate the effectiveness of our proposed model in mining general item co-occurrence patterns and avoiding negative transfer for data-sparse markets.

Enhancing federated learning robustness through randomization and mixture

Protecting data privacy is a significant challenge in machine learning (ML), and federated learning (FL) has emerged as a decentralized learning solution to address this issue. However, FL is vulnerable to poisoning attacks, which control and interrupt the learning process to substantially increase the error rate of the system. The aggregation algorithm’s robustness is crucial to prevent such attacks; however previous Byzantine-robust algorithms have exhibited vulnerability to maliciously crafted model updates. We propose three different aggregation functions namely: Switch, Layered-Switch and Weighted FedAvg. Our proposed methods involve switching between aggregation functions. We evaluate the effectiveness of these methods against a model poisoning attack to demonstrate their robustness. To observe the performance of our proposed aggregation functions, we utilized them within a federated learning framework to classify the CIFAR10, CIFAR10 and Fashion-MNIST datasets. The simulation results demonstrate that all of these methods exhibit greater robustness against the employed adversarial attack. Our approach achieves an enhancement in performance during a poisoning attack, surpassing previous Byzantine-robust algorithms by 5%, 15% and 25% on the MNIST, CIFAR10 and CIFAR100 datasets, respectively. Among the proposed aggregation functions, Weighted FedAvg has shown the highest success rate on the datasets utilized in this research.

A superpixel‐based color difference detection algorithm for dyed fabrics

AbstractIn order to enhance the accuracy and efficiency of color difference detection for dyed fabrics, this article introduces a novel superpixel‐based color difference detection algorithm, which exhibits three significant improvements over the previous algorithm. First, it proposes a more rational color feature extraction method to extract more detailed color features from fabric images, which uses superpixels as basic units for both color feature extraction and color difference detection. Second, the algorithm employs the CIEDE2000 color difference formula to calculate color difference values. This eliminates the need for obtaining standard fabric images as references in advance, making the process more convenient and practical. Finally, an area‐based color difference calculation method is proposed based on the human visual mechanism, ensuring that the evaluation results are more consistent with human eye observations. Experimental results demonstrate that the proposed algorithm provides more accurate and visually consistent color difference assessments compared to the previous algorithm.

Faster Modular Composition

A new Las Vegas algorithm is presented for the composition of two polynomials modulo a third one, over an arbitrary field. When the degrees of these polynomials are bounded by n , the algorithm uses O ( n 1.43 ) field operations, breaking through the 3/2 barrier in the exponent for the first time. The previous fastest algebraic algorithms, due to Brent and Kung in 1978, require O ( n 1.63 ) field operations in general, and n 3/2+ o (1) field operations in the special case of power series over a field of large enough characteristic. If cubic-time matrix multiplication is used, the new algorithm runs in n 5/3+ o (1) operations, while previous ones run in O ( n 2 ) operations. Our approach relies on the computation of a matrix of algebraic relations that is typically of small size. Randomization is used to reduce arbitrary input to this favorable situation.

Particle dynamics in spherically symmetric electro-vacuum instantons

In this paper, we study the geodesic motion in spherically symmetric electro-vacuum Euclidean solutions of the Einstein equation. There are two kinds of such solutions: the Euclidean Reissner–Nordström (ERN) metrics, and the Bertotti–Robinson-like (BR) metrics, the latter having constant Kretschmann scalar. First, we derive the motion equations for the ERN spacetime and we generalize the results of Battista–Esposito, showing that all orbits in as ERN spacetime are unbounded if and only if it has an event horizon. We also obtain the Weierstrass form of the polar radial motion, providing an efficient tool for numerical computations. We then study the angular deflection of orbits in the Euclidean Schwarzschild spacetime which, in contrast to the Lorentzian background, can be either positive or negative. We observe the presence of a null and a maximal deflection rings for particles with velocity at infinity v>1\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$v>1$$\\end{document} and we give approximate values for their size when v≳1.\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$v > rsim 1.$$\\end{document} For BR spacetimes, we obtain analytic solutions for the radial motion in proper length, involving (hyperbolic) trigonometric functions and we deduce that orbits either exponentially go to the singularity or are periodic. Finally, we apply the previous results and use algorithms related to Weierstrass’ elliptic functions to produce a Python code to plot orbits of the spacetimes ERN and BR, and draw “shadows” of the first ones, as it was already done before for classical black holes.

Control and physical verification of 6-DOF manipulator for power inspection robots based on expert PID algorithm

To enhance the performance of power inspection robots in intricate nuclear power stations, it is necessary to improve their response speed and accuracy. This paper uses the manipulator of the power inspection robot as the primary research object, and unlike previous control algorithm research, which only remained in the software simulation stage, we constructed a set of physical verification platforms based on CAN communication and physically verified the robotic arm’s control algorithm. First, the forward motion model is established based on the geometric structure of the manipulator and D-H parameter method, and the kinematic equation of the manipulator is solved by combining geometric method and algebraic method. Secondly, in order to conduct comparison tests, we designed PID controllers and expert PID controllers by utilising the expertise of experts. The results show that compared with the traditional PID algorithm, the expert PID algorithm has a faster response speed in the control process of the manipulator. It converges quickly in 0.75 s and has a smaller overshoot, with a maximum of only 6.9%. This confirms the expert PID algorithm’s good control effect on the robotic arm, allowing the six-degree-of-freedom robotic arm to travel more accurately and swiftly along the trajectory of the target point.

A general positivity-preserving algorithm for implicit high-order finite volume schemes solving the Euler and Navier-Stokes equations

This paper presents a general positivity-preserving algorithm for implicit high-order finite volume schemes that solve compressible Euler and Navier-Stokes equations to ensure the positivity of density and internal energy (or pressure). Previous positivity-preserving algorithms are mainly based on the slope limiting or flux limiting technique, which rely on the existence of low-order positivity-preserving schemes. This dependency poses serious restrictions on extending these algorithms to temporally implicit schemes since it is difficult to know if a low-order implicit scheme is positivity-preserving. In the present paper, a new positivity-preserving algorithm is proposed in terms of the flux correction technique. And the factors of the flux correction are determined by a residual correction procedure. For a finite volume scheme that is capable of achieving a converged solution, we show that the correction factors are in the order of unity with additional high-order terms corresponding to the spatial and temporal rates of convergence. Therefore, the proposed positivity-preserving algorithm is accuracy-reserving and asymptotically consistent. The notable advantage of this method is that it does not rely on the existence of low-order positivity-preserving baseline schemes. Therefore, it can be applied to the implicit schemes solving Euler and especially Navier-Stokes equations. In the present paper, the proposed technique is applied to an implicit dual time-stepping finite volume scheme with temporal second-order and spatial high-order accuracy. The present positivity-preserving algorithm is implemented in an iterative manner to ensure that the dual time-stepping iteration will converge to the positivity-preserving solution. Another similar correction technique is also proposed to ensure that the solution remains positivity-preserving at each sub-iteration. Numerical results demonstrate that the proposed algorithm preserves positive density and internal energy in all test cases and significantly improves the robustness of the numerical schemes.