A novel algorithm for source location by utilizing the time difference of arrival (TDOA) measurements of a signal received at spatially separated sensors is proposed. The algorithm is based on quadratic constraint tot...A novel algorithm for source location by utilizing the time difference of arrival (TDOA) measurements of a signal received at spatially separated sensors is proposed. The algorithm is based on quadratic constraint total least-squares (QC-TLS) method and gives an explicit solution. The total least-squares method is a generalized data fitting method that is appropriate for cases when the system model contains error or is not known exactly, and quadratic constraint, which could be realized via Lagrange multipliers technique, could constrain the solution to the location equations to improve location accuracy. Comparisons of performance with ordinary least-squares are made, and Monte Carlo simulations are performed. Simulation results indicate that the proposed algorithm has high location accuracy and achieves accuracy close to the Cramer-Rao lower bound (CRLB) near the small TDOA measurement error region.展开更多
Order-recursive least-squares(ORLS)algorithms are applied to the prob-lems of estimation and identification of FIR or ARMA system parameters where a fixedset of input signal samples is available and the desired order ...Order-recursive least-squares(ORLS)algorithms are applied to the prob-lems of estimation and identification of FIR or ARMA system parameters where a fixedset of input signal samples is available and the desired order of the underlying model isunknown.On the basis of several universal formulae for updating nonsymmetric projec-tion operators,this paper presents three kinds of LS algorithms,called nonsymmetric,symmetric and square root normalized fast ORLS algorithms,respectively.As to the au-thors’ knowledge,the first and the third have not been so far provided,and the second isone of those which have the lowest computational requirement.Several simplified versionsof the algorithms are also considered.展开更多
This paper focuses on the problem of adaptive blind source separation (BSS). First, a recursive least-squares (RLS) whitening algorithm is proposed. By combining it with a natural gradient-based RLS algorithm for nonl...This paper focuses on the problem of adaptive blind source separation (BSS). First, a recursive least-squares (RLS) whitening algorithm is proposed. By combining it with a natural gradient-based RLS algorithm for nonlinear principle component analysis (PCA), and using reasonable approximations, a novel RLS algorithm which can achieve BSS without additional pre-whitening of the observed mixtures is obtained. Analyses of the equilibrium points show that both of the RLS whitening algorithm and the natural gradient-based RLS algorithm for BSS have the desired convergence properties. It is also proved that the combined new RLS algorithm for BSS is equivariant and has the property of keeping the separating matrix from becoming singular. Finally, the effectiveness of the proposed algorithm is verified by extensive simulation results.展开更多
Mixed-weight least-squares (MWLS) predictive control algorithm, compared with quadratic programming (QP) method, has the advantages of reducing the computer burden, quick calculation speed and dealing with the case in...Mixed-weight least-squares (MWLS) predictive control algorithm, compared with quadratic programming (QP) method, has the advantages of reducing the computer burden, quick calculation speed and dealing with the case in which the optimization is infeasible. But it can only deal with soft constraints. In order to deal with hard constraints and guarantee feasibility, an improved algorithm is proposed by recalculating the setpoint according to the hard constraints before calculating the manipulated variable and MWLS algorithm is used to satisfy the requirement of soft constraints for the system with the input constraints and output constraints. The algorithm can not only guarantee stability of the system and zero steady state error, but also satisfy the hard constraints of input and output variables. The simulation results show the improved algorithm is feasible and effective.展开更多
This paper presents a new highly parallel algorithm for computing the minimum-norm least-squares solution of inconsistent linear equations Ax = b(A∈Rm×n,b∈R (A)). By this algorithm the solution x = A + b is obt...This paper presents a new highly parallel algorithm for computing the minimum-norm least-squares solution of inconsistent linear equations Ax = b(A∈Rm×n,b∈R (A)). By this algorithm the solution x = A + b is obtained in T = n(log2m + log2(n - r + 1) + 5) + log2m + 1 steps with P=mn processors when m × 2(n - 1) and with P = 2n(n - 1) processors otherwise.展开更多
In this paper,we prove that Euclid's algorithm,Bezout's equation and Divi-sion algorithm are equivalent to each other.Our result shows that Euclid has preliminarily established the theory of divisibility and t...In this paper,we prove that Euclid's algorithm,Bezout's equation and Divi-sion algorithm are equivalent to each other.Our result shows that Euclid has preliminarily established the theory of divisibility and the greatest common divisor.We further provided several suggestions for teaching.展开更多
Previous studies have shown that deep learning is very effective in detecting known attacks.However,when facing unknown attacks,models such as Deep Neural Networks(DNN)combined with Long Short-Term Memory(LSTM),Convol...Previous studies have shown that deep learning is very effective in detecting known attacks.However,when facing unknown attacks,models such as Deep Neural Networks(DNN)combined with Long Short-Term Memory(LSTM),Convolutional Neural Networks(CNN)combined with LSTM,and so on are built by simple stacking,which has the problems of feature loss,low efficiency,and low accuracy.Therefore,this paper proposes an autonomous detectionmodel for Distributed Denial of Service attacks,Multi-Scale Convolutional Neural Network-Bidirectional Gated Recurrent Units-Single Headed Attention(MSCNN-BiGRU-SHA),which is based on a Multistrategy Integrated Zebra Optimization Algorithm(MI-ZOA).The model undergoes training and testing with the CICDDoS2019 dataset,and its performance is evaluated on a new GINKS2023 dataset.The hyperparameters for Conv_filter and GRU_unit are optimized using the Multi-strategy Integrated Zebra Optimization Algorithm(MIZOA).The experimental results show that the test accuracy of the MSCNN-BiGRU-SHA model based on the MIZOA proposed in this paper is as high as 0.9971 in the CICDDoS 2019 dataset.The evaluation accuracy of the new dataset GINKS2023 created in this paper is 0.9386.Compared to the MSCNN-BiGRU-SHA model based on the Zebra Optimization Algorithm(ZOA),the detection accuracy on the GINKS2023 dataset has improved by 5.81%,precisionhas increasedby 1.35%,the recallhas improvedby 9%,and theF1scorehas increasedby 5.55%.Compared to the MSCNN-BiGRU-SHA models developed using Grid Search,Random Search,and Bayesian Optimization,the MSCNN-BiGRU-SHA model optimized with the MI-ZOA exhibits better performance in terms of accuracy,precision,recall,and F1 score.展开更多
In order to improve the efficiency of cloud-based web services,an improved plant growth simulation algorithm scheduling model.This model first used mathematical methods to describe the relationships between cloud-base...In order to improve the efficiency of cloud-based web services,an improved plant growth simulation algorithm scheduling model.This model first used mathematical methods to describe the relationships between cloud-based web services and the constraints of system resources.Then,a light-induced plant growth simulation algorithm was established.The performance of the algorithm was compared through several plant types,and the best plant model was selected as the setting for the system.Experimental results show that when the number of test cloud-based web services reaches 2048,the model being 2.14 times faster than PSO,2.8 times faster than the ant colony algorithm,2.9 times faster than the bee colony algorithm,and a remarkable 8.38 times faster than the genetic algorithm.展开更多
Tensor canonical decomposition （shorted as CANDECOMP/PARAFAC or CP） decomposes a tensor as a sum of rank-one tensors, which finds numerous applications in signal processing, hypergraph analysis, data analysis, etc. ...Tensor canonical decomposition （shorted as CANDECOMP/PARAFAC or CP） decomposes a tensor as a sum of rank-one tensors, which finds numerous applications in signal processing, hypergraph analysis, data analysis, etc. Alternating least-squares （ALS） is one of the most popular numerical algorithms for solving it. While there have been lots of efforts for enhancing its efficiency, in general its convergence can not been guaranteed. In this paper, we cooperate the ALS and the trust-region technique from optimization field to generate a trust-region-based alternating least-squares （TRALS） method for CP. Under mild assumptions, we prove that the whole iterative sequence generated by TRALS converges to a stationary point of CP. This thus provides a reasonable way to alleviate the swamps, the notorious phenomena of ALS that slow down the speed of the algorithm. Moreover, the trust region itself, in contrast to the regularization alternating least-squares （RALS） method, provides a self-adaptive way in choosing the parameter, which is essential for the efficiency of the algorithm. Our theoretical result is thus stronger than that of RALS in [26], which only proved the cluster point of the iterative sequence generated by RALS is a stationary point. In order to accelerate the new algorithm, we adopt an extrapolation scheme. We apply our algorithm to the amino acid fluorescence data decomposition from chemometrics, BCM decomposition and rank-（Lr, Lr, 1） decomposition arising from signal processing, and compare it with ALS and RALS. The numerical results show that TRALS is superior to ALS and RALS, both from the number of iterations and CPU time perspectives.展开更多
The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because o...The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because of its straightforward,single-solution evolution framework.However,a potential draw-back of IGA is the lack of utilization of historical information,which could lead to an imbalance between exploration and exploitation,especially in large-scale DPFSPs.As a consequence,this paper develops an IGA with memory and learning mechanisms(MLIGA)to efficiently solve the DPFSP targeted at the mini-malmakespan.InMLIGA,we incorporate a memory mechanism to make a more informed selection of the initial solution at each stage of the search,by extending,reconstructing,and reinforcing the information from previous solutions.In addition,we design a twolayer cooperative reinforcement learning approach to intelligently determine the key parameters of IGA and the operations of the memory mechanism.Meanwhile,to ensure that the experience generated by each perturbation operator is fully learned and to reduce the prior parameters of MLIGA,a probability curve-based acceptance criterion is proposed by combining a cube root function with custom rules.At last,a discrete adaptive learning rate is employed to enhance the stability of the memory and learningmechanisms.Complete ablation experiments are utilized to verify the effectiveness of the memory mechanism,and the results show that this mechanism is capable of improving the performance of IGA to a large extent.Furthermore,through comparative experiments involving MLIGA and five state-of-the-art algorithms on 720 benchmarks,we have discovered that MLI-GA demonstrates significant potential for solving large-scale DPFSPs.This indicates that MLIGA is well-suited for real-world distributed flow shop scheduling.展开更多
Precisely estimating the state of health(SOH)of lithium-ion batteries is essential for battery management systems(BMS),as it plays a key role in ensuring the safe and reliable operation of battery systems.However,curr...Precisely estimating the state of health(SOH)of lithium-ion batteries is essential for battery management systems(BMS),as it plays a key role in ensuring the safe and reliable operation of battery systems.However,current SOH estimation methods often overlook the valuable temperature information that can effectively characterize battery aging during capacity degradation.Additionally,the Elman neural network,which is commonly employed for SOH estimation,exhibits several drawbacks,including slow training speed,a tendency to become trapped in local minima,and the initialization of weights and thresholds using pseudo-random numbers,leading to unstable model performance.To address these issues,this study addresses the challenge of precise and effective SOH detection by proposing a method for estimating the SOH of lithium-ion batteries based on differential thermal voltammetry(DTV)and an SSA-Elman neural network.Firstly,two health features(HFs)considering temperature factors and battery voltage are extracted fromthe differential thermal voltammetry curves and incremental capacity curves.Next,the Sparrow Search Algorithm(SSA)is employed to optimize the initial weights and thresholds of the Elman neural network,forming the SSA-Elman neural network model.To validate the performance,various neural networks,including the proposed SSA-Elman network,are tested using the Oxford battery aging dataset.The experimental results demonstrate that the method developed in this study achieves superior accuracy and robustness,with a mean absolute error(MAE)of less than 0.9%and a rootmean square error(RMSE)below 1.4%.展开更多
Uneven power distribution,transient voltage,and frequency deviations are observed in the photovoltaic storage hybrid inverter during the switching between grid-connected and island modes.In response to these issues,th...Uneven power distribution,transient voltage,and frequency deviations are observed in the photovoltaic storage hybrid inverter during the switching between grid-connected and island modes.In response to these issues,this paper proposes a grid-connected/island switching control strategy for photovoltaic storage hybrid inverters based on the modified chimpanzee optimization algorithm.The proposed strategy incorporates coupling compensation and power differentiation elements based on the traditional droop control.Then,it combines the angular frequency and voltage amplitude adjustments provided by the phase-locked loop-free pre-synchronization control strategy.Precise pre-synchronization is achieved by regulating the virtual current to zero and aligning the photovoltaic storage hybrid inverter with the grid voltage.Additionally,two novel operators,learning and emotional behaviors are introduced to enhance the optimization precision of the chimpanzee algorithm.These operators ensure high-precision and high-reliability optimization of the droop control parameters for photovoltaic storage hybrid inverters.A Simulink model was constructed for simulation analysis,which validated the optimized control strategy’s ability to evenly distribute power under load transients.This strategy effectively mitigated transient voltage and current surges during mode transitions.Consequently,seamless and efficient switching between gridconnected and island modes was achieved for the photovoltaic storage hybrid inverter.The enhanced energy utilization efficiency,in turn,offers robust technical support for grid stability.展开更多
Smallholder farming in West Africa faces various challenges, such as limited access to seeds, fertilizers, modern mechanization, and agricultural climate services. Crop productivity obtained under these conditions var...Smallholder farming in West Africa faces various challenges, such as limited access to seeds, fertilizers, modern mechanization, and agricultural climate services. Crop productivity obtained under these conditions varies significantly from one farmer to another, making it challenging to accurately estimate crop production through crop models. This limitation has implications for the reliability of using crop models as agricultural decision-making support tools. To support decision making in agriculture, an approach combining a genetic algorithm (GA) with the crop model AquaCrop is proposed for a location-specific calibration of maize cropping. In this approach, AquaCrop is used to simulate maize crop yield while the GA is used to derive optimal parameters set at grid cell resolution from various combinations of cultivar parameters and crop management in the process of crop and management options calibration. Statistics on pairwise simulated and observed yields indicate that the coefficient of determination varies from 0.20 to 0.65, with a yield deviation ranging from 8% to 36% across Burkina Faso (BF). An analysis of the optimal parameter sets shows that regardless of the climatic zone, a base temperature of 10˚C and an upper temperature of 32˚C is observed in at least 50% of grid cells. The growing season length and the harvest index vary significantly across BF, with the highest values found in the Soudanian zone and the lowest values in the Sahelian zone. Regarding management strategies, the fertility mean rate is approximately 35%, 39%, and 49% for the Sahelian, Soudano-sahelian, and Soudanian zones, respectively. The mean weed cover is around 36%, with the Sahelian and Soudano-sahelian zones showing the highest variability. The proposed approach can be an alternative to the conventional one-size-fits-all approach commonly used for regional crop modeling. Moreover, it has the potential to explore the performance of cropping strategies to adapt to changing climate conditions.展开更多
The traditional A^(*)algorithm exhibits a low efficiency in the path planning of unmanned surface vehicles(USVs).In addition,the path planned presents numerous redundant inflection waypoints,and the security is low,wh...The traditional A^(*)algorithm exhibits a low efficiency in the path planning of unmanned surface vehicles(USVs).In addition,the path planned presents numerous redundant inflection waypoints,and the security is low,which is not conducive to the control of USV and also affects navigation safety.In this paper,these problems were addressed through the following improvements.First,the path search angle and security were comprehensively considered,and a security expansion strategy of nodes based on the 5×5 neighborhood was proposed.The A^(*)algorithm search neighborhood was expanded from 3×3 to 5×5,and safe nodes were screened out for extension via the node security expansion strategy.This algorithm can also optimize path search angles while improving path security.Second,the distance from the current node to the target node was introduced into the heuristic function.The efficiency of the A^(*)algorithm was improved,and the path was smoothed using the Floyd algorithm.For the dynamic adjustment of the weight to improve the efficiency of DWA,the distance from the USV to the target point was introduced into the evaluation function of the dynamic-window approach(DWA)algorithm.Finally,combined with the local target point selection strategy,the optimized DWA algorithm was performed for local path planning.The experimental results show the smooth and safe path planned by the fusion algorithm,which can successfully avoid dynamic obstacles and is effective and feasible in path planning for USVs.展开更多
Quantum computing offers unprecedented computational power, enabling simultaneous computations beyond traditional computers. Quantum computers differ significantly from classical computers, necessitating a distinct ap...Quantum computing offers unprecedented computational power, enabling simultaneous computations beyond traditional computers. Quantum computers differ significantly from classical computers, necessitating a distinct approach to algorithm design, which involves taming quantum mechanical phenomena. This paper extends the numbering of computable programs to be applied in the quantum computing context. Numbering computable programs is a theoretical computer science concept that assigns unique numbers to individual programs or algorithms. Common methods include Gödel numbering which encodes programs as strings of symbols or characters, often used in formal systems and mathematical logic. Based on the proposed numbering approach, this paper presents a mechanism to explore the set of possible quantum algorithms. The proposed approach is able to construct useful circuits such as Quantum Key Distribution BB84 protocol, which enables sender and receiver to establish a secure cryptographic key via a quantum channel. The proposed approach facilitates the process of exploring and constructing quantum algorithms.展开更多
This paper presents an optimized strategy for multiple integrations of photovoltaic distributed generation (PV-DG) within radial distribution power systems. The proposed methodology focuses on identifying the optimal ...This paper presents an optimized strategy for multiple integrations of photovoltaic distributed generation (PV-DG) within radial distribution power systems. The proposed methodology focuses on identifying the optimal allocation and sizing of multiple PV-DG units to minimize power losses using a probabilistic PV model and time-series power flow analysis. Addressing the uncertainties in PV output due to weather variability and diurnal cycles is critical. A probabilistic assessment offers a more robust analysis of DG integration’s impact on the grid, potentially leading to more reliable system planning. The presented approach employs a genetic algorithm (GA) and a determined PV output profile and probabilistic PV generation profile based on experimental measurements for one year of solar radiation in Cairo, Egypt. The proposed algorithms are validated using a co-simulation framework that integrates MATLAB and OpenDSS, enabling analysis on a 33-bus test system. This framework can act as a guideline for creating other co-simulation algorithms to enhance computing platforms for contemporary modern distribution systems within smart grids concept. The paper presents comparisons with previous research studies and various interesting findings such as the considered hours for developing the probabilistic model presents different results.展开更多
This paper addresses the shortcomings of the Sparrow and Eagle Optimization Algorithm (SBOA) in terms of convergence accuracy, convergence speed, and susceptibility to local optima. To this end, an improved Sparrow an...This paper addresses the shortcomings of the Sparrow and Eagle Optimization Algorithm (SBOA) in terms of convergence accuracy, convergence speed, and susceptibility to local optima. To this end, an improved Sparrow and Eagle Optimization Algorithm (HS-SBOA) is proposed. Initially, the algorithm employs Iterative Mapping to generate an initial sparrow and eagle population, enhancing the diversity of the population during the global search phase. Subsequently, an adaptive weighting strategy is introduced during the exploration phase of the algorithm to achieve a balance between exploration and exploitation. Finally, to avoid the algorithm falling into local optima, a Cauchy mutation operation is applied to the current best individual. To validate the performance of the HS-SBOA algorithm, it was applied to the CEC2021 benchmark function set and three practical engineering problems, and compared with other optimization algorithms such as the Grey Wolf Optimization (GWO), Particle Swarm Optimization (PSO), and Whale Optimization Algorithm (WOA) to test the effectiveness of the improved algorithm. The simulation experimental results show that the HS-SBOA algorithm demonstrates significant advantages in terms of convergence speed and accuracy, thereby validating the effectiveness of its improved strategies.展开更多
This paper introduces an optimized planning approach for integrating photovoltaic as distributed generation (PV-DG) into the radial distribution power systems, utilizing exhaustive load flow (ELF), loss sensitivity fa...This paper introduces an optimized planning approach for integrating photovoltaic as distributed generation (PV-DG) into the radial distribution power systems, utilizing exhaustive load flow (ELF), loss sensitivity factor (LSF), genetic algorithms (GA) methods, and numerical method based on LSF. The methodology aims to determine the optimal allocation and sizing of multiple PV-DG to minimize power loss through time series power flow analysis. An approach utilizing continuous sensitivity analysis is developed and inherently leverages power flow and loss equations to compute LSF of all buses in the system towards employing a dynamic PV-DG model for more accurate results. The algorithm uses a numerical grid search method to optimize PV-DG placement in a power distribution system, focusing on minimizing system losses. It combines iterative analysis, sensitivity assessment, and comprehensive visualization to identify and present the optimal PV-DG configurations. The present-ed algorithms are verified through co-simulation framework combining MATLAB and OpenDSS to carry out analysis for 12-bus radial distribution test system. The proposed numerical method is compared with other algorithms, such as ELF, LSF methods, and Genetic Algorithms (GA). Results show that the proposed numerical method performs well in comparison with LSF and ELF solutions.展开更多
Thetraditional first-order reliability method(FORM)often encounters challengeswith non-convergence of results or excessive calculation when analyzing complex engineering problems.To improve the global convergence spee...Thetraditional first-order reliability method(FORM)often encounters challengeswith non-convergence of results or excessive calculation when analyzing complex engineering problems.To improve the global convergence speed of structural reliability analysis,an improved coati optimization algorithm(COA)is proposed in this paper.In this study,the social learning strategy is used to improve the coati optimization algorithm(SL-COA),which improves the convergence speed and robustness of the newheuristic optimization algorithm.Then,the SL-COAis comparedwith the latest heuristic optimization algorithms such as the original COA,whale optimization algorithm(WOA),and osprey optimization algorithm(OOA)in the CEC2005 and CEC2017 test function sets and two engineering optimization design examples.The optimization results show that the proposed SL-COA algorithm has a high competitiveness.Secondly,this study introduces the SL-COA algorithm into the MPP(Most Probable Point)search process based on FORM and constructs a new reliability analysis method.Finally,the proposed reliability analysis method is verified by four mathematical examples and two engineering examples.The results show that the proposed SL-COA-assisted FORM exhibits fast convergence and avoids premature convergence to local optima as demonstrated by its successful application to problems such as composite cylinder design and support bracket analysis.展开更多
Cyclic-system-based optimization(CSBO)is an innovative metaheuristic algorithm(MHA)that draws inspiration from the workings of the human blood circulatory system.However,CSBO still faces challenges in solving complex ...Cyclic-system-based optimization(CSBO)is an innovative metaheuristic algorithm(MHA)that draws inspiration from the workings of the human blood circulatory system.However,CSBO still faces challenges in solving complex optimization problems,including limited convergence speed and a propensity to get trapped in local optima.To improve the performance of CSBO further,this paper proposes improved cyclic-system-based optimization(ICSBO).First,in venous blood circulation,an adaptive parameter that changes with evolution is introduced to improve the balance between convergence and diversity in this stage and enhance the exploration of search space.Second,the simplex method strategy is incorporated into the systemic and pulmonary circulations,which improves the update formulas.A learning strategy aimed at the optimal individual,combined with a straightforward opposition-based learning approach,is employed to enhance population convergence while preserving diversity.Finally,a novel external archive utilizing a diversity supplementation mechanism is introduced to enhance population diversity,maximize the use of superior genes,and lower the risk of the population being trapped in local optima.Testing on the CEC2017 benchmark set shows that compared with the original CSBO and eight other outstanding MHAs,ICSBO demonstrates remarkable advantages in convergence speed,convergence precision,and stability.展开更多
文摘A novel algorithm for source location by utilizing the time difference of arrival (TDOA) measurements of a signal received at spatially separated sensors is proposed. The algorithm is based on quadratic constraint total least-squares (QC-TLS) method and gives an explicit solution. The total least-squares method is a generalized data fitting method that is appropriate for cases when the system model contains error or is not known exactly, and quadratic constraint, which could be realized via Lagrange multipliers technique, could constrain the solution to the location equations to improve location accuracy. Comparisons of performance with ordinary least-squares are made, and Monte Carlo simulations are performed. Simulation results indicate that the proposed algorithm has high location accuracy and achieves accuracy close to the Cramer-Rao lower bound (CRLB) near the small TDOA measurement error region.
文摘Order-recursive least-squares(ORLS)algorithms are applied to the prob-lems of estimation and identification of FIR or ARMA system parameters where a fixedset of input signal samples is available and the desired order of the underlying model isunknown.On the basis of several universal formulae for updating nonsymmetric projec-tion operators,this paper presents three kinds of LS algorithms,called nonsymmetric,symmetric and square root normalized fast ORLS algorithms,respectively.As to the au-thors’ knowledge,the first and the third have not been so far provided,and the second isone of those which have the lowest computational requirement.Several simplified versionsof the algorithms are also considered.
文摘This paper focuses on the problem of adaptive blind source separation (BSS). First, a recursive least-squares (RLS) whitening algorithm is proposed. By combining it with a natural gradient-based RLS algorithm for nonlinear principle component analysis (PCA), and using reasonable approximations, a novel RLS algorithm which can achieve BSS without additional pre-whitening of the observed mixtures is obtained. Analyses of the equilibrium points show that both of the RLS whitening algorithm and the natural gradient-based RLS algorithm for BSS have the desired convergence properties. It is also proved that the combined new RLS algorithm for BSS is equivariant and has the property of keeping the separating matrix from becoming singular. Finally, the effectiveness of the proposed algorithm is verified by extensive simulation results.
基金National Key Basic Research and Development(No.2002CB312200)
文摘Mixed-weight least-squares (MWLS) predictive control algorithm, compared with quadratic programming (QP) method, has the advantages of reducing the computer burden, quick calculation speed and dealing with the case in which the optimization is infeasible. But it can only deal with soft constraints. In order to deal with hard constraints and guarantee feasibility, an improved algorithm is proposed by recalculating the setpoint according to the hard constraints before calculating the manipulated variable and MWLS algorithm is used to satisfy the requirement of soft constraints for the system with the input constraints and output constraints. The algorithm can not only guarantee stability of the system and zero steady state error, but also satisfy the hard constraints of input and output variables. The simulation results show the improved algorithm is feasible and effective.
基金This project is supported by the National Natural Science Foundation of China
文摘This paper presents a new highly parallel algorithm for computing the minimum-norm least-squares solution of inconsistent linear equations Ax = b(A∈Rm×n,b∈R (A)). By this algorithm the solution x = A + b is obtained in T = n(log2m + log2(n - r + 1) + 5) + log2m + 1 steps with P=mn processors when m × 2(n - 1) and with P = 2n(n - 1) processors otherwise.
基金Supported by the Natural Science Foundation of Chongqing(General Program,NO.CSTB2022NSCQ-MSX0884)Discipline Teaching Special Project of Yangtze Normal University(csxkjx14)。
文摘In this paper,we prove that Euclid's algorithm,Bezout's equation and Divi-sion algorithm are equivalent to each other.Our result shows that Euclid has preliminarily established the theory of divisibility and the greatest common divisor.We further provided several suggestions for teaching.
基金supported by Science and Technology Innovation Programfor Postgraduate Students in IDP Subsidized by Fundamental Research Funds for the Central Universities(Project No.ZY20240335)support of the Research Project of the Key Technology of Malicious Code Detection Based on Data Mining in APT Attack(Project No.2022IT173)the Research Project of the Big Data Sensitive Information Supervision Technology Based on Convolutional Neural Network(Project No.2022011033).
文摘Previous studies have shown that deep learning is very effective in detecting known attacks.However,when facing unknown attacks,models such as Deep Neural Networks(DNN)combined with Long Short-Term Memory(LSTM),Convolutional Neural Networks(CNN)combined with LSTM,and so on are built by simple stacking,which has the problems of feature loss,low efficiency,and low accuracy.Therefore,this paper proposes an autonomous detectionmodel for Distributed Denial of Service attacks,Multi-Scale Convolutional Neural Network-Bidirectional Gated Recurrent Units-Single Headed Attention(MSCNN-BiGRU-SHA),which is based on a Multistrategy Integrated Zebra Optimization Algorithm(MI-ZOA).The model undergoes training and testing with the CICDDoS2019 dataset,and its performance is evaluated on a new GINKS2023 dataset.The hyperparameters for Conv_filter and GRU_unit are optimized using the Multi-strategy Integrated Zebra Optimization Algorithm(MIZOA).The experimental results show that the test accuracy of the MSCNN-BiGRU-SHA model based on the MIZOA proposed in this paper is as high as 0.9971 in the CICDDoS 2019 dataset.The evaluation accuracy of the new dataset GINKS2023 created in this paper is 0.9386.Compared to the MSCNN-BiGRU-SHA model based on the Zebra Optimization Algorithm(ZOA),the detection accuracy on the GINKS2023 dataset has improved by 5.81%,precisionhas increasedby 1.35%,the recallhas improvedby 9%,and theF1scorehas increasedby 5.55%.Compared to the MSCNN-BiGRU-SHA models developed using Grid Search,Random Search,and Bayesian Optimization,the MSCNN-BiGRU-SHA model optimized with the MI-ZOA exhibits better performance in terms of accuracy,precision,recall,and F1 score.
基金Shanxi Province Higher Education Science and Technology Innovation Fund Project(2022-676)Shanxi Soft Science Program Research Fund Project(2016041008-6)。
文摘In order to improve the efficiency of cloud-based web services,an improved plant growth simulation algorithm scheduling model.This model first used mathematical methods to describe the relationships between cloud-based web services and the constraints of system resources.Then,a light-induced plant growth simulation algorithm was established.The performance of the algorithm was compared through several plant types,and the best plant model was selected as the setting for the system.Experimental results show that when the number of test cloud-based web services reaches 2048,the model being 2.14 times faster than PSO,2.8 times faster than the ant colony algorithm,2.9 times faster than the bee colony algorithm,and a remarkable 8.38 times faster than the genetic algorithm.
文摘Tensor canonical decomposition （shorted as CANDECOMP/PARAFAC or CP） decomposes a tensor as a sum of rank-one tensors, which finds numerous applications in signal processing, hypergraph analysis, data analysis, etc. Alternating least-squares （ALS） is one of the most popular numerical algorithms for solving it. While there have been lots of efforts for enhancing its efficiency, in general its convergence can not been guaranteed. In this paper, we cooperate the ALS and the trust-region technique from optimization field to generate a trust-region-based alternating least-squares （TRALS） method for CP. Under mild assumptions, we prove that the whole iterative sequence generated by TRALS converges to a stationary point of CP. This thus provides a reasonable way to alleviate the swamps, the notorious phenomena of ALS that slow down the speed of the algorithm. Moreover, the trust region itself, in contrast to the regularization alternating least-squares （RALS） method, provides a self-adaptive way in choosing the parameter, which is essential for the efficiency of the algorithm. Our theoretical result is thus stronger than that of RALS in [26], which only proved the cluster point of the iterative sequence generated by RALS is a stationary point. In order to accelerate the new algorithm, we adopt an extrapolation scheme. We apply our algorithm to the amino acid fluorescence data decomposition from chemometrics, BCM decomposition and rank-（Lr, Lr, 1） decomposition arising from signal processing, and compare it with ALS and RALS. The numerical results show that TRALS is superior to ALS and RALS, both from the number of iterations and CPU time perspectives.
基金supported in part by the National Key Research and Development Program of China under Grant No.2021YFF0901300in part by the National Natural Science Foundation of China under Grant Nos.62173076 and 72271048.
文摘The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because of its straightforward,single-solution evolution framework.However,a potential draw-back of IGA is the lack of utilization of historical information,which could lead to an imbalance between exploration and exploitation,especially in large-scale DPFSPs.As a consequence,this paper develops an IGA with memory and learning mechanisms(MLIGA)to efficiently solve the DPFSP targeted at the mini-malmakespan.InMLIGA,we incorporate a memory mechanism to make a more informed selection of the initial solution at each stage of the search,by extending,reconstructing,and reinforcing the information from previous solutions.In addition,we design a twolayer cooperative reinforcement learning approach to intelligently determine the key parameters of IGA and the operations of the memory mechanism.Meanwhile,to ensure that the experience generated by each perturbation operator is fully learned and to reduce the prior parameters of MLIGA,a probability curve-based acceptance criterion is proposed by combining a cube root function with custom rules.At last,a discrete adaptive learning rate is employed to enhance the stability of the memory and learningmechanisms.Complete ablation experiments are utilized to verify the effectiveness of the memory mechanism,and the results show that this mechanism is capable of improving the performance of IGA to a large extent.Furthermore,through comparative experiments involving MLIGA and five state-of-the-art algorithms on 720 benchmarks,we have discovered that MLI-GA demonstrates significant potential for solving large-scale DPFSPs.This indicates that MLIGA is well-suited for real-world distributed flow shop scheduling.
基金supported by the National Natural Science Foundation of China(NSFC)under Grant(No.51677058).
文摘Precisely estimating the state of health(SOH)of lithium-ion batteries is essential for battery management systems(BMS),as it plays a key role in ensuring the safe and reliable operation of battery systems.However,current SOH estimation methods often overlook the valuable temperature information that can effectively characterize battery aging during capacity degradation.Additionally,the Elman neural network,which is commonly employed for SOH estimation,exhibits several drawbacks,including slow training speed,a tendency to become trapped in local minima,and the initialization of weights and thresholds using pseudo-random numbers,leading to unstable model performance.To address these issues,this study addresses the challenge of precise and effective SOH detection by proposing a method for estimating the SOH of lithium-ion batteries based on differential thermal voltammetry(DTV)and an SSA-Elman neural network.Firstly,two health features(HFs)considering temperature factors and battery voltage are extracted fromthe differential thermal voltammetry curves and incremental capacity curves.Next,the Sparrow Search Algorithm(SSA)is employed to optimize the initial weights and thresholds of the Elman neural network,forming the SSA-Elman neural network model.To validate the performance,various neural networks,including the proposed SSA-Elman network,are tested using the Oxford battery aging dataset.The experimental results demonstrate that the method developed in this study achieves superior accuracy and robustness,with a mean absolute error(MAE)of less than 0.9%and a rootmean square error(RMSE)below 1.4%.
基金received funding from the Postgraduate Research&Practice Innovation Program of Jiangsu Province(SJCX23_1633)2023 University Student Innovation and Entrepreneurship Training Program(202311463009Z)+1 种基金Changzhou Science and Technology Support Project(CE20235045)Open Project of Jiangsu Key Laboratory of Power Transmission&Distribution Equipment Technology(2021JSSPD12).
文摘Uneven power distribution,transient voltage,and frequency deviations are observed in the photovoltaic storage hybrid inverter during the switching between grid-connected and island modes.In response to these issues,this paper proposes a grid-connected/island switching control strategy for photovoltaic storage hybrid inverters based on the modified chimpanzee optimization algorithm.The proposed strategy incorporates coupling compensation and power differentiation elements based on the traditional droop control.Then,it combines the angular frequency and voltage amplitude adjustments provided by the phase-locked loop-free pre-synchronization control strategy.Precise pre-synchronization is achieved by regulating the virtual current to zero and aligning the photovoltaic storage hybrid inverter with the grid voltage.Additionally,two novel operators,learning and emotional behaviors are introduced to enhance the optimization precision of the chimpanzee algorithm.These operators ensure high-precision and high-reliability optimization of the droop control parameters for photovoltaic storage hybrid inverters.A Simulink model was constructed for simulation analysis,which validated the optimized control strategy’s ability to evenly distribute power under load transients.This strategy effectively mitigated transient voltage and current surges during mode transitions.Consequently,seamless and efficient switching between gridconnected and island modes was achieved for the photovoltaic storage hybrid inverter.The enhanced energy utilization efficiency,in turn,offers robust technical support for grid stability.
文摘Smallholder farming in West Africa faces various challenges, such as limited access to seeds, fertilizers, modern mechanization, and agricultural climate services. Crop productivity obtained under these conditions varies significantly from one farmer to another, making it challenging to accurately estimate crop production through crop models. This limitation has implications for the reliability of using crop models as agricultural decision-making support tools. To support decision making in agriculture, an approach combining a genetic algorithm (GA) with the crop model AquaCrop is proposed for a location-specific calibration of maize cropping. In this approach, AquaCrop is used to simulate maize crop yield while the GA is used to derive optimal parameters set at grid cell resolution from various combinations of cultivar parameters and crop management in the process of crop and management options calibration. Statistics on pairwise simulated and observed yields indicate that the coefficient of determination varies from 0.20 to 0.65, with a yield deviation ranging from 8% to 36% across Burkina Faso (BF). An analysis of the optimal parameter sets shows that regardless of the climatic zone, a base temperature of 10˚C and an upper temperature of 32˚C is observed in at least 50% of grid cells. The growing season length and the harvest index vary significantly across BF, with the highest values found in the Soudanian zone and the lowest values in the Sahelian zone. Regarding management strategies, the fertility mean rate is approximately 35%, 39%, and 49% for the Sahelian, Soudano-sahelian, and Soudanian zones, respectively. The mean weed cover is around 36%, with the Sahelian and Soudano-sahelian zones showing the highest variability. The proposed approach can be an alternative to the conventional one-size-fits-all approach commonly used for regional crop modeling. Moreover, it has the potential to explore the performance of cropping strategies to adapt to changing climate conditions.
基金Supported by the EDD of China(No.80912020104)the Science and Technology Commission of Shanghai Municipality(No.22ZR1427700 and No.23692106900).
文摘The traditional A^(*)algorithm exhibits a low efficiency in the path planning of unmanned surface vehicles(USVs).In addition,the path planned presents numerous redundant inflection waypoints,and the security is low,which is not conducive to the control of USV and also affects navigation safety.In this paper,these problems were addressed through the following improvements.First,the path search angle and security were comprehensively considered,and a security expansion strategy of nodes based on the 5×5 neighborhood was proposed.The A^(*)algorithm search neighborhood was expanded from 3×3 to 5×5,and safe nodes were screened out for extension via the node security expansion strategy.This algorithm can also optimize path search angles while improving path security.Second,the distance from the current node to the target node was introduced into the heuristic function.The efficiency of the A^(*)algorithm was improved,and the path was smoothed using the Floyd algorithm.For the dynamic adjustment of the weight to improve the efficiency of DWA,the distance from the USV to the target point was introduced into the evaluation function of the dynamic-window approach(DWA)algorithm.Finally,combined with the local target point selection strategy,the optimized DWA algorithm was performed for local path planning.The experimental results show the smooth and safe path planned by the fusion algorithm,which can successfully avoid dynamic obstacles and is effective and feasible in path planning for USVs.
文摘Quantum computing offers unprecedented computational power, enabling simultaneous computations beyond traditional computers. Quantum computers differ significantly from classical computers, necessitating a distinct approach to algorithm design, which involves taming quantum mechanical phenomena. This paper extends the numbering of computable programs to be applied in the quantum computing context. Numbering computable programs is a theoretical computer science concept that assigns unique numbers to individual programs or algorithms. Common methods include Gödel numbering which encodes programs as strings of symbols or characters, often used in formal systems and mathematical logic. Based on the proposed numbering approach, this paper presents a mechanism to explore the set of possible quantum algorithms. The proposed approach is able to construct useful circuits such as Quantum Key Distribution BB84 protocol, which enables sender and receiver to establish a secure cryptographic key via a quantum channel. The proposed approach facilitates the process of exploring and constructing quantum algorithms.
文摘This paper presents an optimized strategy for multiple integrations of photovoltaic distributed generation (PV-DG) within radial distribution power systems. The proposed methodology focuses on identifying the optimal allocation and sizing of multiple PV-DG units to minimize power losses using a probabilistic PV model and time-series power flow analysis. Addressing the uncertainties in PV output due to weather variability and diurnal cycles is critical. A probabilistic assessment offers a more robust analysis of DG integration’s impact on the grid, potentially leading to more reliable system planning. The presented approach employs a genetic algorithm (GA) and a determined PV output profile and probabilistic PV generation profile based on experimental measurements for one year of solar radiation in Cairo, Egypt. The proposed algorithms are validated using a co-simulation framework that integrates MATLAB and OpenDSS, enabling analysis on a 33-bus test system. This framework can act as a guideline for creating other co-simulation algorithms to enhance computing platforms for contemporary modern distribution systems within smart grids concept. The paper presents comparisons with previous research studies and various interesting findings such as the considered hours for developing the probabilistic model presents different results.
文摘This paper addresses the shortcomings of the Sparrow and Eagle Optimization Algorithm (SBOA) in terms of convergence accuracy, convergence speed, and susceptibility to local optima. To this end, an improved Sparrow and Eagle Optimization Algorithm (HS-SBOA) is proposed. Initially, the algorithm employs Iterative Mapping to generate an initial sparrow and eagle population, enhancing the diversity of the population during the global search phase. Subsequently, an adaptive weighting strategy is introduced during the exploration phase of the algorithm to achieve a balance between exploration and exploitation. Finally, to avoid the algorithm falling into local optima, a Cauchy mutation operation is applied to the current best individual. To validate the performance of the HS-SBOA algorithm, it was applied to the CEC2021 benchmark function set and three practical engineering problems, and compared with other optimization algorithms such as the Grey Wolf Optimization (GWO), Particle Swarm Optimization (PSO), and Whale Optimization Algorithm (WOA) to test the effectiveness of the improved algorithm. The simulation experimental results show that the HS-SBOA algorithm demonstrates significant advantages in terms of convergence speed and accuracy, thereby validating the effectiveness of its improved strategies.
文摘This paper introduces an optimized planning approach for integrating photovoltaic as distributed generation (PV-DG) into the radial distribution power systems, utilizing exhaustive load flow (ELF), loss sensitivity factor (LSF), genetic algorithms (GA) methods, and numerical method based on LSF. The methodology aims to determine the optimal allocation and sizing of multiple PV-DG to minimize power loss through time series power flow analysis. An approach utilizing continuous sensitivity analysis is developed and inherently leverages power flow and loss equations to compute LSF of all buses in the system towards employing a dynamic PV-DG model for more accurate results. The algorithm uses a numerical grid search method to optimize PV-DG placement in a power distribution system, focusing on minimizing system losses. It combines iterative analysis, sensitivity assessment, and comprehensive visualization to identify and present the optimal PV-DG configurations. The present-ed algorithms are verified through co-simulation framework combining MATLAB and OpenDSS to carry out analysis for 12-bus radial distribution test system. The proposed numerical method is compared with other algorithms, such as ELF, LSF methods, and Genetic Algorithms (GA). Results show that the proposed numerical method performs well in comparison with LSF and ELF solutions.
基金funded by the National Key Research and Development Program(Grant No.2022YFB3706904).
文摘Thetraditional first-order reliability method(FORM)often encounters challengeswith non-convergence of results or excessive calculation when analyzing complex engineering problems.To improve the global convergence speed of structural reliability analysis,an improved coati optimization algorithm(COA)is proposed in this paper.In this study,the social learning strategy is used to improve the coati optimization algorithm(SL-COA),which improves the convergence speed and robustness of the newheuristic optimization algorithm.Then,the SL-COAis comparedwith the latest heuristic optimization algorithms such as the original COA,whale optimization algorithm(WOA),and osprey optimization algorithm(OOA)in the CEC2005 and CEC2017 test function sets and two engineering optimization design examples.The optimization results show that the proposed SL-COA algorithm has a high competitiveness.Secondly,this study introduces the SL-COA algorithm into the MPP(Most Probable Point)search process based on FORM and constructs a new reliability analysis method.Finally,the proposed reliability analysis method is verified by four mathematical examples and two engineering examples.The results show that the proposed SL-COA-assisted FORM exhibits fast convergence and avoids premature convergence to local optima as demonstrated by its successful application to problems such as composite cylinder design and support bracket analysis.
基金supported by the Project of Scientific and Technological Innovation Development of Jilin in China under Grant 20210103090.
文摘Cyclic-system-based optimization(CSBO)is an innovative metaheuristic algorithm(MHA)that draws inspiration from the workings of the human blood circulatory system.However,CSBO still faces challenges in solving complex optimization problems,including limited convergence speed and a propensity to get trapped in local optima.To improve the performance of CSBO further,this paper proposes improved cyclic-system-based optimization(ICSBO).First,in venous blood circulation,an adaptive parameter that changes with evolution is introduced to improve the balance between convergence and diversity in this stage and enhance the exploration of search space.Second,the simplex method strategy is incorporated into the systemic and pulmonary circulations,which improves the update formulas.A learning strategy aimed at the optimal individual,combined with a straightforward opposition-based learning approach,is employed to enhance population convergence while preserving diversity.Finally,a novel external archive utilizing a diversity supplementation mechanism is introduced to enhance population diversity,maximize the use of superior genes,and lower the risk of the population being trapped in local optima.Testing on the CEC2017 benchmark set shows that compared with the original CSBO and eight other outstanding MHAs,ICSBO demonstrates remarkable advantages in convergence speed,convergence precision,and stability.
