The cemented tailings backfill(CTB)with initial defects is more prone to destabilization damage under the influence of various unfavorable factors during the mining process.In order to investigate its influence on the...The cemented tailings backfill(CTB)with initial defects is more prone to destabilization damage under the influence of various unfavorable factors during the mining process.In order to investigate its influence on the stability of underground mining engineering,this paper simulates the generation of different degrees of initial defects inside the CTB by adding different contents of air-entraining agent(AEA),investigates the acoustic emission RA/AF eigenvalues of CTB with different contents of AEA under uniaxial compression,and adopts various denoising algorithms(e.g.,moving average smoothing,median filtering,and outlier detection)to improve the accuracy of the data.The variance and autocorrelation coefficients of RA/AF parameters were analyzed in conjunction with the critical slowing down(CSD)theory.The results show that the acoustic emission RA/AF values can be used to characterize the progressive damage evolution of CTB.The denoising algorithm processed the AE signals to reduce the effects of extraneous noise and anomalous spikes.Changes in the variance curves provide clear precursor information,while abrupt changes in the autocorrelation coefficient can be used as an auxiliary localization warning signal.The phenomenon of dramatic increase in the variance and autocorrelation coefficient curves during the compression-tightening stage,which is influenced by the initial defects,can lead to false warnings.As the initial defects of the CTB increase,its instability precursor time and instability time are prolonged,the peak stress decreases,and the time difference between the CTB and the instability damage is smaller.The results provide a new method for real-time monitoring and early warning of CTB instability damage.展开更多
This paper proposes an equivalent modeling method for photovoltaic(PV)power stations via a particle swarm optimization(PSO)K-means clustering(KMC)algorithm with passive filter parameter clustering to address the compl...This paper proposes an equivalent modeling method for photovoltaic(PV)power stations via a particle swarm optimization(PSO)K-means clustering(KMC)algorithm with passive filter parameter clustering to address the complexities,simulation time cost and convergence problems of detailed PV power station models.First,the amplitude–frequency curves of different filter parameters are analyzed.Based on the results,a grouping parameter set for characterizing the external filter characteristics is established.These parameters are further defined as clustering parameters.A single PV inverter model is then established as a prerequisite foundation.The proposed equivalent method combines the global search capability of PSO with the rapid convergence of KMC,effectively overcoming the tendency of KMC to become trapped in local optima.This approach enhances both clustering accuracy and numerical stability when determining equivalence for PV inverter units.Using the proposed clustering method,both a detailed PV power station model and an equivalent model are developed and compared.Simulation and hardwarein-loop(HIL)results based on the equivalent model verify that the equivalent method accurately represents the dynamic characteristics of PVpower stations and adapts well to different operating conditions.The proposed equivalent modeling method provides an effective analysis tool for future renewable energy integration research.展开更多
This study proposes a Multi-Stage Sparrow Search Algorithm(MS-SSA)for precise structural damage identification.Initially,the structural static displacement sensitivity formulation is derived via the Sherman-Morrison-W...This study proposes a Multi-Stage Sparrow Search Algorithm(MS-SSA)for precise structural damage identification.Initially,the structural static displacement sensitivity formulation is derived via the Sherman-Morrison-Woodbury formula,and an objective function is constructed by integrating the sensitivity equations with the L2-norm penalty.Subsequently,MS-SSA is implemented to sequentially achieve preliminary damage localization and accurate quantification.In the localization phase,a constrained narrow-bound search space is predefined to identify potential damage regions.Leveraging this feedback,the sensitivity equations are condensed,and the search boundaries are adaptively refined for the quantification phase,where SSA is reapplied to precisely determine damage severity while mitigating misjudgments.TheMS-SSA framework exhibits two distinct advantages:(i)Phase I localization accelerates convergence by constraining the search space,as it does not target precise quantification;and(ii)the significant reduction in unknowns achieved by excluding intact elements in Phase II enables rapid convergence to the global optimum.Comparative studies against the GreyWolf Optimizer(GWO),Whale Optimization Algorithm(WOA),and standard SSA demonstrate that the proposed method effectively overcomes computational instability,slowconvergence,and large errors inherent in swarm intelligence optimization for damage identification.Specifically,numerical case studies reveal that the identification error is reduced to merely 9%~22%of that associated with existing methods,with experimental validation confirming reductions to 18%~22%.Overall,the proposed approach achieves high-fidelity damage identification while eliminating false positives and false negatives.展开更多
Rutting is a serious issue in asphalt pavement,which may reduce the pavement driving quality and safety.Accurately predicting rutting depth is a crucial task in pavement engineering,providing crucial decision support ...Rutting is a serious issue in asphalt pavement,which may reduce the pavement driving quality and safety.Accurately predicting rutting depth is a crucial task in pavement engineering,providing crucial decision support for asphalt pavement design and maintenance.However,accurate prediction of pavement rutting still remains a significant challenge for pavement engineers.This research first selects the loading number,temperature,dynamic modulus,asphalt layer thickness,and base layer type and thickness as candidate features.Data preprocessing,including outlier handling and feature selection,is then performed.Finally,based on the stacking algorithm,a multi-model fusion approach for predicting rutting depth in asphalt pavements is proposed,using ridge regression(RidgeR),K-nearest neighbor(KNN),multilayer perceptron(MLP),and random forest(RF)models as base models,and support vector machine(SVM)as a meta-model.The model is optimized using a Bayesian optimization model.Results demonstrate the feasibility of using correlation analysis for feature selection.Seven features,including axle weight,upper layer temperature,and middle layer modulus,were selected as predictive features.While all the basic models achieved good prediction accuracy,the stacking ensemble model exhibited lower variance and bias,demonstrating superior generalization capability.The asphalt pavement rutting depth prediction method based on the stacking algorithm multi-model fusion proposed in this research can accurately predict the rutting depth.展开更多
Optimization problems are prevalent in various fields of science and engineering,with several real-world applications characterized by high dimensionality and complex search landscapes.Starfish optimization algorithm(...Optimization problems are prevalent in various fields of science and engineering,with several real-world applications characterized by high dimensionality and complex search landscapes.Starfish optimization algorithm(SFOA)is a recently optimizer inspired by swarm intelligence,which is effective for numerical optimization,but it may encounter premature and local convergence for complex optimization problems.To address these challenges,this paper proposes the multi-strategy enhanced crested porcupine-starfish optimization algorithm(MCPSFOA).The core innovation of MCPSFOA lies in employing a hybrid strategy to improve SFOA,which integrates the exploratory mechanisms of SFOA with the diverse search capacity of the Crested Porcupine Optimizer(CPO).This synergy enhances MCPSFOA’s ability to navigate complex and multimodal search spaces.To further prevent premature convergence,MCPSFOA incorporates Lévy flight,leveraging its characteristic long and short jump patterns to enable large-scale exploration and escape from local optima.Subsequently,Gaussian mutation is applied for precise solution tuning,introducing controlled perturbations that enhance accuracy and mitigate the risk of insufficient exploitation.Notably,the population diversity enhancement mechanism periodically identifies and resets stagnant individuals,thereby consistently revitalizing population variety throughout the optimization process.MCPSFOA is rigorously evaluated on 24 classical benchmark functions(including high-dimensional cases),the CEC2017 suite,and the CEC2022 suite.MCPSFOA achieves superior overall performance with Friedman mean ranks of 2.208,2.310 and 2.417 on these benchmark functions,outperforming 11 state-of-the-art algorithms.Furthermore,the practical applicability of MCPSFOA is confirmed through its successful application to five engineering optimization cases,where it also yields excellent results.In conclusion,MCPSFOA is not only a highly effective and reliable optimizer for benchmark functions,but also a practical tool for solving real-world optimization problems.展开更多
With the integration of clean energy,the increasing penetration of distributed power sources,controllable loads,and energy-storage resources in smart grids is causing substantial difficulties in the safe,stable,and co...With the integration of clean energy,the increasing penetration of distributed power sources,controllable loads,and energy-storage resources in smart grids is causing substantial difficulties in the safe,stable,and cost-effective operation of power systems.Existing research often fails to consider the interconnections among optimal dispatching and the distribution capacities of wind,solar,and energy-storage systems(ESSs).This increases the costs and dispatching difficulties.In response to this situation,a two-stage capacity-allocation approach for wind and solar power and storage in an active distribution network(ADN)is proposed in this paper.This approach is founded based on the whale migration algorithm(WMA).First,an optimization dispatch model that considers controllable loads and energy storage is formulated to minimize the dispatch operation costs of the ADN.In this optimization model,the overall cost of the ADN is taken as the objective function.The optimal configuration for wind–solar–storage capacities is obtained through the WMA.Simulation results confirm that the WMA effectively balances the solution accuracy and computational efficiency,while the proposed scheme enhances the economic performance of active distribution grids.展开更多
Background:Mortality in intensive care due to community-acquired pneumonia remains high.Although machine learning models have demonstrated promising predictive performance,standardized validation and explicit calibrat...Background:Mortality in intensive care due to community-acquired pneumonia remains high.Although machine learning models have demonstrated promising predictive performance,standardized validation and explicit calibration assessment across independent clinical settings remain limited.Methods:This study systematically reviewed machine learning algorithms for mortality prediction in community-acquired pneumonia.A search across six databases identified 241 records,of which seven met the eligibility criteria.Standalone algorithms meeting predefined selection criteria were subsequently implemented within a standardized validation framework and evaluated on the NACef cohort(n=764;163 deaths,21.2%).Model performance was assessed using nested cross-validation and independent hold-out testing,with evaluation of both discrimination and calibration metrics.Results:Three standalone algorithms,XGBoost,LightGBM,and Logistic Regression,were selected for standardized implementation and evaluation.In nested cross-validation,all models achieved mean AUC values above 0.90.On the independent hold-out test set,uncalibrated AUC values were 0.941 for XGBoost,0.933 for LightGBM,and 0.915 for Logistic Regression,with small absolute differences across models.Recall ranged from 0.818(LightGBM)to 0.969(Logistic Regression),while precision ranged from 0.615(Logistic Regression)to 0.658(LightGBM).Calibration analysis indicated probability misalignment before recalibration.Platt scaling and isotonic regression improved calibration metrics,with isotonic regression achieving the lowest expected calibration error while maintaining comparable discrimination.Conclusion:Logistic Regression,XGBoost,and LightGBM demonstrated comparable discrimination,and calibration improved probability reliability,underscoring the importance of harmonized validation and explicit calibration assessment in clinical machine learning research.展开更多
To enhance the accuracy of path planning of unmanned surface vehicles(USVs),the particle swarm optimization algorithm(PSO)is improved based on species migration strategies observed in ecology.By incorporating the conc...To enhance the accuracy of path planning of unmanned surface vehicles(USVs),the particle swarm optimization algorithm(PSO)is improved based on species migration strategies observed in ecology.By incorporating the concept of particle sight distance,an improved algorithm,called SD-IPSO,is proposed for the real-time autonomous navigation of USVs in marine environments.The algorithm refines the individual behavior pattern of particles in the population,effectively improving both local and global search capabilities while avoiding premature convergence.The effectiveness of the algorithm is validated using standard test functions from CEC-2017 function library,assessing it from multiple dimensions.Sensitivity analysis is conducted on key parameters in the algorithm,including particle sight distance and population size.Results indicate that compared with PSO,SD-IPSO demonstrates significant advantages in optimization accuracy and convergence speed.The application of SD-IPSO in path planning is further investigated through a 14-point traveling salesman problem(TSP)example and navigation autonomous tests of USVs in marine environments.Findings demonstrate that the proposed algorithm exhibits superior optimization capabilities and can effectively address the path planning challenges of USVs.展开更多
The bat algorithm(BA)is a metaheuristic algorithm for global optimisation that simulates the echolocation behaviour of bats with varying pulse rates of emission and loudness,which can be used to find the globally opti...The bat algorithm(BA)is a metaheuristic algorithm for global optimisation that simulates the echolocation behaviour of bats with varying pulse rates of emission and loudness,which can be used to find the globally optimal solutions for various optimisation problems.Knowing the recent criticises of the originality of equations,the principle of BA is concise and easy to implement,and its mathematical structure can be seen as a hybrid particle swarm with simulated annealing.In this research,the authors focus on the performance optimisation of BA as a solver rather than discussing its originality issues.In terms of operation effect,BA has an acceptable convergence speed.However,due to the low proportion of time used to explore the search space,it is easy to converge prematurely and fall into the local optima.The authors propose an adaptive multi-stage bat algorithm(AMSBA).By tuning the algorithm's focus at three different stages of the search process,AMSBA can achieve a better balance between exploration and exploitation and improve its exploration ability by enhancing its performance in escaping local optima as well as maintaining a certain convergence speed.Therefore,AMSBA can achieve solutions with better quality.A convergence analysis was conducted to demonstrate the global convergence of AMSBA.The authors also perform simulation experiments on 30 benchmark functions from IEEE CEC 2017 as the objective functions and compare AMSBA with some original and improved swarm-based algorithms.The results verify the effectiveness and superiority of AMSBA.AMSBA is also compared with eight representative optimisation algorithms on 10 benchmark functions derived from IEEE CEC 2020,while this experiment is carried out on five different dimensions of the objective functions respectively.A balance and diversity analysis was performed on AMSBA to demonstrate its improvement over the original BA in terms of balance.AMSBA was also applied to the multi-threshold image segmentation of Citrus Macular disease,which is a bacterial infection that causes lesions on citrus trees.The segmentation results were analysed by comparing each comparative algorithm's peak signal-to-noise ratio,structural similarity index and feature similarity index.The results show that the proposed BA-based algorithm has apparent advantages,and it can effectively segment the disease spots from citrus leaves when the segmentation threshold is at a low level.Based on a comprehensive study,the authors think the proposed optimiser has mitigated the main drawbacks of the BA,and it can be utilised as an effective optimisation tool.展开更多
Background:In recent years,there has been a growing trend in the utilization of observational studies that make use of routinely collected healthcare data(RCD).These studies rely on algorithms to identify specific hea...Background:In recent years,there has been a growing trend in the utilization of observational studies that make use of routinely collected healthcare data(RCD).These studies rely on algorithms to identify specific health conditions(e.g.,diabetes or sepsis)for statistical analyses.However,there has been substantial variation in the algorithm development and validation,leading to frequently suboptimal performance and posing a significant threat to the validity of study findings.Unfortunately,these issues are often overlooked.Methods:We systematically developed guidance for the development,validation,and evaluation of algorithms designed to identify health status(DEVELOP-RCD).Our initial efforts involved conducting both a narrative review and a systematic review of published studies on the concepts and methodological issues related to algorithm development,validation,and evaluation.Subsequently,we conducted an empirical study on an algorithm for identifying sepsis.Based on these findings,we formulated specific workflow and recommendations for algorithm development,validation,and evaluation within the guidance.Finally,the guidance underwent independent review by a panel of 20 external experts who then convened a consensus meeting to finalize it.Results:A standardized workflow for algorithm development,validation,and evaluation was established.Guided by specific health status considerations,the workflow comprises four integrated steps:assessing an existing algorithm’s suitability for the target health status;developing a new algorithm using recommended methods;validating the algorithm using prescribed performance measures;and evaluating the impact of the algorithm on study results.Additionally,13 good practice recommendations were formulated with detailed explanations.Furthermore,a practical study on sepsis identification was included to demonstrate the application of this guidance.Conclusions:The establishment of guidance is intended to aid researchers and clinicians in the appropriate and accurate development and application of algorithms for identifying health status from RCD.This guidance has the potential to enhance the credibility of findings from observational studies involving RCD.展开更多
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%.展开更多
The presence of circles in the network maximum flow problem increases the complexity of the preflow algorithm.This study proposes a novel two-stage preflow algorithm to address this issue.First,this study proves that ...The presence of circles in the network maximum flow problem increases the complexity of the preflow algorithm.This study proposes a novel two-stage preflow algorithm to address this issue.First,this study proves that at least one zero-flow arc must be present when the flow of the network reaches its maximum value.This result indicates that the maximum flow of the network will remain constant if a zero-flow arc within a circle is removed;therefore,the maximum flow of each network without circles can be calculated.The first stage involves identifying the zero-flow arc in the circle when the network flow reaches its maximum.The second stage aims to remove the zero-flow arc identified and modified in the first stage,thereby producing a new network without circles.The maximum flow of the original looped network can be obtained by solving the maximum flow of the newly generated acyclic network.Finally,an example is provided to demonstrate the validity and feasibility of this algorithm.This algorithm not only improves computational efficiency but also provides new perspectives and tools for solving similar network optimization problems.展开更多
To tackle the path planning problem,this study introduced a novel algorithm called two-stage parameter adjustment-based differential evolution(TPADE).This algorithm draws inspiration from group behavior to implement a...To tackle the path planning problem,this study introduced a novel algorithm called two-stage parameter adjustment-based differential evolution(TPADE).This algorithm draws inspiration from group behavior to implement a two-stage scaling factor variation strategy.In the initial phase,it adapts according to environmental complexity.In the following phase,it combines individual and global experiences to fine-tune the orientation factor,effectively improving its global search capability.Furthermore,this study developed a new population update method,ensuring that well-adapted individuals are retained,which enhances population diversity.In benchmark function tests across different dimensions,the proposed algorithm consistently demonstrates superior convergence accuracy and speed.This study also tested the TPADE algorithm in path planning simulations.The experimental results reveal that the TPADE algorithm outperforms existing algorithms by achieving path lengths of 28.527138 and 31.963990 in simple and complex map environments,respectively.These findings indicate that the proposed algorithm is more adaptive and efficient in path planning.展开更多
The virtual preassembly of super-high steel bridge towers faces a challenge in the efficient and precise extraction of complex cross-sectional features.Factors such as fabrication errors,gravity-induced deformations,a...The virtual preassembly of super-high steel bridge towers faces a challenge in the efficient and precise extraction of complex cross-sectional features.Factors such as fabrication errors,gravity-induced deformations,and temperature fluctuations can compromise the accuracy of contour extraction.To address these limitations,an improved Alpha-shape-based point cloud contour extraction method is proposed.The proposed approach uses a hierarchical strategy to process three-dimensional laser scanning point clouds.The processed data are then subjected to curvatureadaptive voxel filtering to reduce acquisition noise.In addition,an enhanced iterative closest point(ICP)variant with correspondence validation accurately aligns the discrete point cloud segments.The proposed curvature-responsive Alpha-shape framework enables multiscale contour delineation through topology-adaptive threshold modulation,which resolves boundary ambiguities in geometrically complex cross-sections.The method was experimentally validated using field-acquired measurement datasets from the Zhangjinggao Yangtze River Bridge tower segments,confirming its capability to reconstruct noncanonical cross-sectional geometries.Three contour extraction methods,including Poisson reconstruction,the conventional Alpha-shape algorithm,and random sample consensus with ICP(RANSAC-ICP),were compared to evaluate the performance of the proposed Alpha-shape algorithm.The results demonstrate that the proposed method achieves superior contour extraction accuracy and data reduction efficiency,highlighting its effectiveness in contour extraction tasks.展开更多
With the rapid development of blockchain technology,the Chinese government has proposed that the commercial use of blockchain services in China should support the national encryption standard,also known as the state s...With the rapid development of blockchain technology,the Chinese government has proposed that the commercial use of blockchain services in China should support the national encryption standard,also known as the state secret algorithm GuoMi algorithm.The original Hyperledger Fabric only supports internationally common encryption algorithms,so it is particularly necessary to enhance support for the national encryption standard.Traditional identity authentication,access control,and security audit technologies have single-point failures,and data can be easily tampered with,leading to trust issues.To address these problems,this paper proposes an optimized and application research plan for Hyperledger Fabric.We study the optimization model of cryptographic components in Hyperledger Fabric,and based on Fabric's pluggable mechanism,we enhance the Fabric architecture with the national encryption standard.In addition,we research key technologies involved in the secure application protocol based on the blockchain.We propose a blockchain-based identity authentication protocol,detailing the design of an identity authentication scheme based on blockchain certificates and Fabric CA,and use a dual-signature method to further improve its security and reliability.Then,we propose a flexible,dynamically configurable real-time access control and security audit mechanism based on blockchain,further enhancing the security of the system.展开更多
A novel intelligent optimization algorithm inspired by nature,called sea otter optimization algorithm(SOOA),is proposed.The SOOA simulates the natural behaviors of sea otters,such as using tactile senses to search for...A novel intelligent optimization algorithm inspired by nature,called sea otter optimization algorithm(SOOA),is proposed.The SOOA simulates the natural behaviors of sea otters,such as using tactile senses to search for food in seawater,grooming their fur,feeding with the aid of stones,and escaping from danger.In the exploration stage,a wetness factor is introduced to control the behavior of sea otters in foraging and grooming;a danger factor is introduced to control the behavior of sea otters in feeding and avoiding dangers in the exploitation stage,and the behaviors of sea otters in responding to different dangers are mathematically modeled.The proposed algorithm is compared with 9 well-known intelligent optimization algorithms,and evaluated in 13 benchmark functions as well as wireless sensor network coverage optimization problems to verify the effectiveness of the proposed algorithm.The experimental results show that the node coverage after SOOA optimization reaches 91.2%in 2D environment and 90.47%in 3D environment.Compared with other algorithms,SOOA is superior and possesses the ability to solve complex optimization problems.展开更多
Quantum algorithms offer more enhanced computational efficiency in comparison to their classical counterparts when solving specific tasks.In this study,we implement the quantum permutation algorithm utilizing a polar ...Quantum algorithms offer more enhanced computational efficiency in comparison to their classical counterparts when solving specific tasks.In this study,we implement the quantum permutation algorithm utilizing a polar molecule within an external electric field.The selection of the molecular qutrit involves the utilization of field-dressed states generated through the pendular modes of SrO.Through the application of multi-target optimal control theory,we strategically design microwave pulses to execute logical operations,including Fourier transform,oracle Ufoperation,and inverse Fourier transform within a three-level molecular qutrit structure.The observed high fidelity of our outcomes is intricately linked to the concept of the quantum speed limit,which quantifies the maximum speed of quantum state manipulation.Subsequently,we design the optimized pulse sequence to successfully simulate the quantum permutation algorithm on a single SrO molecule,achieving remarkable fidelity.Consequently,a quantum circuit comprising a single qutrit suffices to determine permutation parity with just a single function evaluation.Therefore,our results indicate that the optimal control theory can be well applied to the quantum computation of polar molecular systems.展开更多
In order to address environmental pollution and resource depletion caused by traditional power generation,this paper proposes an adaptive iterative dynamic-balance optimization algorithm that integrates the Improved D...In order to address environmental pollution and resource depletion caused by traditional power generation,this paper proposes an adaptive iterative dynamic-balance optimization algorithm that integrates the Improved Dung Beetle Optimizer(IDBO)with VariationalMode Decomposition(VMD).The IDBO-VMD method is designed to enhance the accuracy and efficiency of wind-speed time-series decomposition and to effectively smooth photovoltaic power fluctuations.This study innovatively improves the traditional variational mode decomposition(VMD)algorithm,and significantly improves the accuracy and adaptive ability of signal decomposition by IDBO selfoptimization of key parameters K and a.On this basis,Fourier transform technology is used to define the boundary point between high frequency and low frequency signals,and a targeted energy distribution strategy is proposed:high frequency fluctuations are allocated to supercapacitors to quickly respond to transient power fluctuations;Lowfrequency components are distributed to lead-carbon batteries,optimizing long-term energy storage and scheduling efficiency.This strategy effectively improves the response speed and stability of the energy storage system.The experimental results demonstrate that the IDBO-VMD algorithm markedly outperforms traditional methods in both decomposition accuracy and computational efficiency.Specifically,it effectively reduces the charge–discharge frequency of the battery,prolongs battery life,and optimizes the operating ranges of the state-of-charge(SOC)for both leadcarbon batteries and supercapacitors.In addition,the energy management strategy based on the algorithm not only improves the overall energy utilization efficiency of the system,but also shows excellent performance in the dynamic management and intelligent scheduling of renewable energy generation.展开更多
Frequency diverse array multiple-input multiple-output(FDA-MIMO)radar has gained considerable research attention due to its ability to effectively counter active repeater deception jamming in complex electromagnetic e...Frequency diverse array multiple-input multiple-output(FDA-MIMO)radar has gained considerable research attention due to its ability to effectively counter active repeater deception jamming in complex electromagnetic environments.The effectiveness of interference suppression by FDA-MIMO is limited by the inherent range-angle coupling issue in the FDA beampattern.Existing literature primarily focuses on control methods for FDA-MIMO radar beam direction under the assumption of static beampatterns,with insufficient exploration of techniques for managing nonstationary beam directions.To address this gap,this paper initially introduces the FDA-MIMO signal model and the calculation formula for the FDA-MIMO array output using the minimum variance distortionless response(MVDR)beamformer.Building on this,the problem of determining the optimal frequency offset for the FDA is rephrased as a convex optimization problem,which is then resolved using the cuckoo search(CS)algorithm.Simulations confirm the effectiveness of the proposed approach,showing that the frequency offsets obtained through the CS algorithm can create a dot-shaped beam direction at the target location while effectively suppressing interference signals within the mainlobe.展开更多
Amplitude Phase Shift Keying(APSK)is more suitable for the nonlinear channels of Low Earth Orbit(LEO)satellite communication systems compared to Quadrature Amplitude Modulation(QAM).To tackle challenges posed by Direc...Amplitude Phase Shift Keying(APSK)is more suitable for the nonlinear channels of Low Earth Orbit(LEO)satellite communication systems compared to Quadrature Amplitude Modulation(QAM).To tackle challenges posed by Direct Current(DC)interference and high demodulation complexity,we propose an APSK demodulation algorithm based on K-means clustering.Initially,static DC components are calculated and removed from the received APSK signals.Subsequently,the estimated APSK constellation points serve as initial centers for K-means clustering.These centers are refined through the K-means process and act as theoretical APSK constellation points for the Max-Log-MAP demodulation algorithm,effectively eliminating residual DC.We then introduce a low-complexity APSK demodulation algorithm that utilizes the symmetry of constellation points along with the Euclidean distance between DC-eliminated signals and these constellation points to minimize the set of constellation points.Simulation results indicate that for 32-APSK,our proposed demodulation submodule reduces computational complexity to approximately one-third that of the Max-Log-MAP algorithm while improving Bit Error Rate(BER)performance by about 0.23 dB.Furthermore,end-to-end simulation experiments conducted within LEO satellite communication systems demonstrate that our approach not only maintains this complexity advantage but also enhances BER performance by approximately 1.1 dB.展开更多
基金Projects(52374138,51764013)supported by the National Natural Science Foundation of ChinaProject(20204BCJ22005)supported by the Training Plan for Academic and Technical Leaders of Major Disciplines of Jiangxi Province,China+1 种基金Project(2019M652277)supported by the China Postdoctoral Science FoundationProject(20192ACBL21014)supported by the Natural Science Youth Foundation Key Projects of Jiangxi Province,China。
摘要The cemented tailings backfill(CTB)with initial defects is more prone to destabilization damage under the influence of various unfavorable factors during the mining process.In order to investigate its influence on the stability of underground mining engineering,this paper simulates the generation of different degrees of initial defects inside the CTB by adding different contents of air-entraining agent(AEA),investigates the acoustic emission RA/AF eigenvalues of CTB with different contents of AEA under uniaxial compression,and adopts various denoising algorithms(e.g.,moving average smoothing,median filtering,and outlier detection)to improve the accuracy of the data.The variance and autocorrelation coefficients of RA/AF parameters were analyzed in conjunction with the critical slowing down(CSD)theory.The results show that the acoustic emission RA/AF values can be used to characterize the progressive damage evolution of CTB.The denoising algorithm processed the AE signals to reduce the effects of extraneous noise and anomalous spikes.Changes in the variance curves provide clear precursor information,while abrupt changes in the autocorrelation coefficient can be used as an auxiliary localization warning signal.The phenomenon of dramatic increase in the variance and autocorrelation coefficient curves during the compression-tightening stage,which is influenced by the initial defects,can lead to false warnings.As the initial defects of the CTB increase,its instability precursor time and instability time are prolonged,the peak stress decreases,and the time difference between the CTB and the instability damage is smaller.The results provide a new method for real-time monitoring and early warning of CTB instability damage.
基金supported by the Research Project of China Southern Power Grid(No.056200KK52222031).
摘要This paper proposes an equivalent modeling method for photovoltaic(PV)power stations via a particle swarm optimization(PSO)K-means clustering(KMC)algorithm with passive filter parameter clustering to address the complexities,simulation time cost and convergence problems of detailed PV power station models.First,the amplitude–frequency curves of different filter parameters are analyzed.Based on the results,a grouping parameter set for characterizing the external filter characteristics is established.These parameters are further defined as clustering parameters.A single PV inverter model is then established as a prerequisite foundation.The proposed equivalent method combines the global search capability of PSO with the rapid convergence of KMC,effectively overcoming the tendency of KMC to become trapped in local optima.This approach enhances both clustering accuracy and numerical stability when determining equivalence for PV inverter units.Using the proposed clustering method,both a detailed PV power station model and an equivalent model are developed and compared.Simulation and hardwarein-loop(HIL)results based on the equivalent model verify that the equivalent method accurately represents the dynamic characteristics of PVpower stations and adapts well to different operating conditions.The proposed equivalent modeling method provides an effective analysis tool for future renewable energy integration research.
摘要This study proposes a Multi-Stage Sparrow Search Algorithm(MS-SSA)for precise structural damage identification.Initially,the structural static displacement sensitivity formulation is derived via the Sherman-Morrison-Woodbury formula,and an objective function is constructed by integrating the sensitivity equations with the L2-norm penalty.Subsequently,MS-SSA is implemented to sequentially achieve preliminary damage localization and accurate quantification.In the localization phase,a constrained narrow-bound search space is predefined to identify potential damage regions.Leveraging this feedback,the sensitivity equations are condensed,and the search boundaries are adaptively refined for the quantification phase,where SSA is reapplied to precisely determine damage severity while mitigating misjudgments.TheMS-SSA framework exhibits two distinct advantages:(i)Phase I localization accelerates convergence by constraining the search space,as it does not target precise quantification;and(ii)the significant reduction in unknowns achieved by excluding intact elements in Phase II enables rapid convergence to the global optimum.Comparative studies against the GreyWolf Optimizer(GWO),Whale Optimization Algorithm(WOA),and standard SSA demonstrate that the proposed method effectively overcomes computational instability,slowconvergence,and large errors inherent in swarm intelligence optimization for damage identification.Specifically,numerical case studies reveal that the identification error is reduced to merely 9%~22%of that associated with existing methods,with experimental validation confirming reductions to 18%~22%.Overall,the proposed approach achieves high-fidelity damage identification while eliminating false positives and false negatives.
基金financial support of the Natural Science Foundation of Hubei Province of China(grant number:2025AFD739).
摘要Rutting is a serious issue in asphalt pavement,which may reduce the pavement driving quality and safety.Accurately predicting rutting depth is a crucial task in pavement engineering,providing crucial decision support for asphalt pavement design and maintenance.However,accurate prediction of pavement rutting still remains a significant challenge for pavement engineers.This research first selects the loading number,temperature,dynamic modulus,asphalt layer thickness,and base layer type and thickness as candidate features.Data preprocessing,including outlier handling and feature selection,is then performed.Finally,based on the stacking algorithm,a multi-model fusion approach for predicting rutting depth in asphalt pavements is proposed,using ridge regression(RidgeR),K-nearest neighbor(KNN),multilayer perceptron(MLP),and random forest(RF)models as base models,and support vector machine(SVM)as a meta-model.The model is optimized using a Bayesian optimization model.Results demonstrate the feasibility of using correlation analysis for feature selection.Seven features,including axle weight,upper layer temperature,and middle layer modulus,were selected as predictive features.While all the basic models achieved good prediction accuracy,the stacking ensemble model exhibited lower variance and bias,demonstrating superior generalization capability.The asphalt pavement rutting depth prediction method based on the stacking algorithm multi-model fusion proposed in this research can accurately predict the rutting depth.
基金supported by the National Natural Science Foundation of China(Grant No.12402139,No.52368070)supported by Hainan Provincial Natural Science Foundation of China(Grant No.524QN223)+3 种基金Scientific Research Startup Foundation of Hainan University(Grant No.RZ2300002710)State Key Laboratory of Structural Analysis,Optimization and CAE Software for Industrial Equipment,Dalian University of Technology(Grant No.GZ24107)the Horizontal Research Project(Grant No.HD-KYH-2024022)Innovative Research Projects for Postgraduate Students in Hainan Province(Grant No.Hys2025-217).
摘要Optimization problems are prevalent in various fields of science and engineering,with several real-world applications characterized by high dimensionality and complex search landscapes.Starfish optimization algorithm(SFOA)is a recently optimizer inspired by swarm intelligence,which is effective for numerical optimization,but it may encounter premature and local convergence for complex optimization problems.To address these challenges,this paper proposes the multi-strategy enhanced crested porcupine-starfish optimization algorithm(MCPSFOA).The core innovation of MCPSFOA lies in employing a hybrid strategy to improve SFOA,which integrates the exploratory mechanisms of SFOA with the diverse search capacity of the Crested Porcupine Optimizer(CPO).This synergy enhances MCPSFOA’s ability to navigate complex and multimodal search spaces.To further prevent premature convergence,MCPSFOA incorporates Lévy flight,leveraging its characteristic long and short jump patterns to enable large-scale exploration and escape from local optima.Subsequently,Gaussian mutation is applied for precise solution tuning,introducing controlled perturbations that enhance accuracy and mitigate the risk of insufficient exploitation.Notably,the population diversity enhancement mechanism periodically identifies and resets stagnant individuals,thereby consistently revitalizing population variety throughout the optimization process.MCPSFOA is rigorously evaluated on 24 classical benchmark functions(including high-dimensional cases),the CEC2017 suite,and the CEC2022 suite.MCPSFOA achieves superior overall performance with Friedman mean ranks of 2.208,2.310 and 2.417 on these benchmark functions,outperforming 11 state-of-the-art algorithms.Furthermore,the practical applicability of MCPSFOA is confirmed through its successful application to five engineering optimization cases,where it also yields excellent results.In conclusion,MCPSFOA is not only a highly effective and reliable optimizer for benchmark functions,but also a practical tool for solving real-world optimization problems.
摘要With the integration of clean energy,the increasing penetration of distributed power sources,controllable loads,and energy-storage resources in smart grids is causing substantial difficulties in the safe,stable,and cost-effective operation of power systems.Existing research often fails to consider the interconnections among optimal dispatching and the distribution capacities of wind,solar,and energy-storage systems(ESSs).This increases the costs and dispatching difficulties.In response to this situation,a two-stage capacity-allocation approach for wind and solar power and storage in an active distribution network(ADN)is proposed in this paper.This approach is founded based on the whale migration algorithm(WMA).First,an optimization dispatch model that considers controllable loads and energy storage is formulated to minimize the dispatch operation costs of the ADN.In this optimization model,the overall cost of the ADN is taken as the objective function.The optimal configuration for wind–solar–storage capacities is obtained through the WMA.Simulation results confirm that the WMA effectively balances the solution accuracy and computational efficiency,while the proposed scheme enhances the economic performance of active distribution grids.
摘要Background:Mortality in intensive care due to community-acquired pneumonia remains high.Although machine learning models have demonstrated promising predictive performance,standardized validation and explicit calibration assessment across independent clinical settings remain limited.Methods:This study systematically reviewed machine learning algorithms for mortality prediction in community-acquired pneumonia.A search across six databases identified 241 records,of which seven met the eligibility criteria.Standalone algorithms meeting predefined selection criteria were subsequently implemented within a standardized validation framework and evaluated on the NACef cohort(n=764;163 deaths,21.2%).Model performance was assessed using nested cross-validation and independent hold-out testing,with evaluation of both discrimination and calibration metrics.Results:Three standalone algorithms,XGBoost,LightGBM,and Logistic Regression,were selected for standardized implementation and evaluation.In nested cross-validation,all models achieved mean AUC values above 0.90.On the independent hold-out test set,uncalibrated AUC values were 0.941 for XGBoost,0.933 for LightGBM,and 0.915 for Logistic Regression,with small absolute differences across models.Recall ranged from 0.818(LightGBM)to 0.969(Logistic Regression),while precision ranged from 0.615(Logistic Regression)to 0.658(LightGBM).Calibration analysis indicated probability misalignment before recalibration.Platt scaling and isotonic regression improved calibration metrics,with isotonic regression achieving the lowest expected calibration error while maintaining comparable discrimination.Conclusion:Logistic Regression,XGBoost,and LightGBM demonstrated comparable discrimination,and calibration improved probability reliability,underscoring the importance of harmonized validation and explicit calibration assessment in clinical machine learning research.
摘要To enhance the accuracy of path planning of unmanned surface vehicles(USVs),the particle swarm optimization algorithm(PSO)is improved based on species migration strategies observed in ecology.By incorporating the concept of particle sight distance,an improved algorithm,called SD-IPSO,is proposed for the real-time autonomous navigation of USVs in marine environments.The algorithm refines the individual behavior pattern of particles in the population,effectively improving both local and global search capabilities while avoiding premature convergence.The effectiveness of the algorithm is validated using standard test functions from CEC-2017 function library,assessing it from multiple dimensions.Sensitivity analysis is conducted on key parameters in the algorithm,including particle sight distance and population size.Results indicate that compared with PSO,SD-IPSO demonstrates significant advantages in optimization accuracy and convergence speed.The application of SD-IPSO in path planning is further investigated through a 14-point traveling salesman problem(TSP)example and navigation autonomous tests of USVs in marine environments.Findings demonstrate that the proposed algorithm exhibits superior optimization capabilities and can effectively address the path planning challenges of USVs.
基金BBSRC,Grant/Award Number:RM32G0178B8National Natural Science Foundation of China,Grant/Award Numbers:U19A2061,U1809209,62076185+11 种基金Science and Technology Development Project of Jilin Province,Grant/Award Number:20190301024NYJilin Provincial Industrial Innovation Special Fund Project,Grant/Award Number:2018C039-3MRC,Grant/Award Number:MC_PC_17171Royal Society,Grant/Award Number:RP202G0230BHF,Grant/Award Number:AA/18/3/34220Hope Foundation for Cancer Research,Grant/Award Number:RM60G0680GCRF,Grant/Award Number:P202PF11Sino-UK Industrial Fund,Grant/Award Number:RP202G0289LIAS,Grant/Award Numbers:P202ED10,P202RE969Data Science Enhancement Fund,Grant/Award Number:P202RE237Fight for Sight,Grant/Award Number:24NN201Sino-UK Education Fund,Grant/Award Number:OP202006。
摘要The bat algorithm(BA)is a metaheuristic algorithm for global optimisation that simulates the echolocation behaviour of bats with varying pulse rates of emission and loudness,which can be used to find the globally optimal solutions for various optimisation problems.Knowing the recent criticises of the originality of equations,the principle of BA is concise and easy to implement,and its mathematical structure can be seen as a hybrid particle swarm with simulated annealing.In this research,the authors focus on the performance optimisation of BA as a solver rather than discussing its originality issues.In terms of operation effect,BA has an acceptable convergence speed.However,due to the low proportion of time used to explore the search space,it is easy to converge prematurely and fall into the local optima.The authors propose an adaptive multi-stage bat algorithm(AMSBA).By tuning the algorithm's focus at three different stages of the search process,AMSBA can achieve a better balance between exploration and exploitation and improve its exploration ability by enhancing its performance in escaping local optima as well as maintaining a certain convergence speed.Therefore,AMSBA can achieve solutions with better quality.A convergence analysis was conducted to demonstrate the global convergence of AMSBA.The authors also perform simulation experiments on 30 benchmark functions from IEEE CEC 2017 as the objective functions and compare AMSBA with some original and improved swarm-based algorithms.The results verify the effectiveness and superiority of AMSBA.AMSBA is also compared with eight representative optimisation algorithms on 10 benchmark functions derived from IEEE CEC 2020,while this experiment is carried out on five different dimensions of the objective functions respectively.A balance and diversity analysis was performed on AMSBA to demonstrate its improvement over the original BA in terms of balance.AMSBA was also applied to the multi-threshold image segmentation of Citrus Macular disease,which is a bacterial infection that causes lesions on citrus trees.The segmentation results were analysed by comparing each comparative algorithm's peak signal-to-noise ratio,structural similarity index and feature similarity index.The results show that the proposed BA-based algorithm has apparent advantages,and it can effectively segment the disease spots from citrus leaves when the segmentation threshold is at a low level.Based on a comprehensive study,the authors think the proposed optimiser has mitigated the main drawbacks of the BA,and it can be utilised as an effective optimisation tool.
基金supported by the National Natural Science Foundation of China(82225049,72104155)the Sichuan Provincial Central Government Guides Local Science and Technology Development Special Project(2022ZYD0127)the 1·3·5 Project for Disciplines of Excellence,West China Hospital,Sichuan University(ZYGD23004).
摘要Background:In recent years,there has been a growing trend in the utilization of observational studies that make use of routinely collected healthcare data(RCD).These studies rely on algorithms to identify specific health conditions(e.g.,diabetes or sepsis)for statistical analyses.However,there has been substantial variation in the algorithm development and validation,leading to frequently suboptimal performance and posing a significant threat to the validity of study findings.Unfortunately,these issues are often overlooked.Methods:We systematically developed guidance for the development,validation,and evaluation of algorithms designed to identify health status(DEVELOP-RCD).Our initial efforts involved conducting both a narrative review and a systematic review of published studies on the concepts and methodological issues related to algorithm development,validation,and evaluation.Subsequently,we conducted an empirical study on an algorithm for identifying sepsis.Based on these findings,we formulated specific workflow and recommendations for algorithm development,validation,and evaluation within the guidance.Finally,the guidance underwent independent review by a panel of 20 external experts who then convened a consensus meeting to finalize it.Results:A standardized workflow for algorithm development,validation,and evaluation was established.Guided by specific health status considerations,the workflow comprises four integrated steps:assessing an existing algorithm’s suitability for the target health status;developing a new algorithm using recommended methods;validating the algorithm using prescribed performance measures;and evaluating the impact of the algorithm on study results.Additionally,13 good practice recommendations were formulated with detailed explanations.Furthermore,a practical study on sepsis identification was included to demonstrate the application of this guidance.Conclusions:The establishment of guidance is intended to aid researchers and clinicians in the appropriate and accurate development and application of algorithms for identifying health status from RCD.This guidance has the potential to enhance the credibility of findings from observational studies involving RCD.
基金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%.
基金The National Natural Science Foundation of China(No.72001107,72271120)the Fundamental Research Funds for the Central Universities(No.NS2024047,NP2024106)the China Postdoctoral Science Foundation(No.2020T130297,2019M660119).
摘要The presence of circles in the network maximum flow problem increases the complexity of the preflow algorithm.This study proposes a novel two-stage preflow algorithm to address this issue.First,this study proves that at least one zero-flow arc must be present when the flow of the network reaches its maximum value.This result indicates that the maximum flow of the network will remain constant if a zero-flow arc within a circle is removed;therefore,the maximum flow of each network without circles can be calculated.The first stage involves identifying the zero-flow arc in the circle when the network flow reaches its maximum.The second stage aims to remove the zero-flow arc identified and modified in the first stage,thereby producing a new network without circles.The maximum flow of the original looped network can be obtained by solving the maximum flow of the newly generated acyclic network.Finally,an example is provided to demonstrate the validity and feasibility of this algorithm.This algorithm not only improves computational efficiency but also provides new perspectives and tools for solving similar network optimization problems.
基金The National Natural Science Foundation of China(No.62272239,62303214)Jiangsu Agricultural Science and Tech-nology Independent Innovation Fund(No.SJ222051).
摘要To tackle the path planning problem,this study introduced a novel algorithm called two-stage parameter adjustment-based differential evolution(TPADE).This algorithm draws inspiration from group behavior to implement a two-stage scaling factor variation strategy.In the initial phase,it adapts according to environmental complexity.In the following phase,it combines individual and global experiences to fine-tune the orientation factor,effectively improving its global search capability.Furthermore,this study developed a new population update method,ensuring that well-adapted individuals are retained,which enhances population diversity.In benchmark function tests across different dimensions,the proposed algorithm consistently demonstrates superior convergence accuracy and speed.This study also tested the TPADE algorithm in path planning simulations.The experimental results reveal that the TPADE algorithm outperforms existing algorithms by achieving path lengths of 28.527138 and 31.963990 in simple and complex map environments,respectively.These findings indicate that the proposed algorithm is more adaptive and efficient in path planning.
基金The National Natural Science Foundation of China(No.52338011)the Start-up Research Fund of Southeast University(No.RF1028624058)+1 种基金the Southeast University Interdisciplinary Research Program for Young Scholarsthe National Key Research and Development Program of China(No.2024YFC3014103).
摘要The virtual preassembly of super-high steel bridge towers faces a challenge in the efficient and precise extraction of complex cross-sectional features.Factors such as fabrication errors,gravity-induced deformations,and temperature fluctuations can compromise the accuracy of contour extraction.To address these limitations,an improved Alpha-shape-based point cloud contour extraction method is proposed.The proposed approach uses a hierarchical strategy to process three-dimensional laser scanning point clouds.The processed data are then subjected to curvatureadaptive voxel filtering to reduce acquisition noise.In addition,an enhanced iterative closest point(ICP)variant with correspondence validation accurately aligns the discrete point cloud segments.The proposed curvature-responsive Alpha-shape framework enables multiscale contour delineation through topology-adaptive threshold modulation,which resolves boundary ambiguities in geometrically complex cross-sections.The method was experimentally validated using field-acquired measurement datasets from the Zhangjinggao Yangtze River Bridge tower segments,confirming its capability to reconstruct noncanonical cross-sectional geometries.Three contour extraction methods,including Poisson reconstruction,the conventional Alpha-shape algorithm,and random sample consensus with ICP(RANSAC-ICP),were compared to evaluate the performance of the proposed Alpha-shape algorithm.The results demonstrate that the proposed method achieves superior contour extraction accuracy and data reduction efficiency,highlighting its effectiveness in contour extraction tasks.
基金supported by Fujian Provincial Social Science Foundation Public Security Theory Research Project(FJ2023TWGA004)Education and Scientific Research Special Project of Fujian Provincial Department of Finance(Research on the Application of Blockchain Technology in Prison Law Enforcement Management),under National Key R&D Program of China(2020YFB1005500)。
摘要With the rapid development of blockchain technology,the Chinese government has proposed that the commercial use of blockchain services in China should support the national encryption standard,also known as the state secret algorithm GuoMi algorithm.The original Hyperledger Fabric only supports internationally common encryption algorithms,so it is particularly necessary to enhance support for the national encryption standard.Traditional identity authentication,access control,and security audit technologies have single-point failures,and data can be easily tampered with,leading to trust issues.To address these problems,this paper proposes an optimized and application research plan for Hyperledger Fabric.We study the optimization model of cryptographic components in Hyperledger Fabric,and based on Fabric's pluggable mechanism,we enhance the Fabric architecture with the national encryption standard.In addition,we research key technologies involved in the secure application protocol based on the blockchain.We propose a blockchain-based identity authentication protocol,detailing the design of an identity authentication scheme based on blockchain certificates and Fabric CA,and use a dual-signature method to further improve its security and reliability.Then,we propose a flexible,dynamically configurable real-time access control and security audit mechanism based on blockchain,further enhancing the security of the system.
基金the Special Research Fund for the Na-tional Key Research and Development Program of China(No.2022ZD0119001)。
摘要A novel intelligent optimization algorithm inspired by nature,called sea otter optimization algorithm(SOOA),is proposed.The SOOA simulates the natural behaviors of sea otters,such as using tactile senses to search for food in seawater,grooming their fur,feeding with the aid of stones,and escaping from danger.In the exploration stage,a wetness factor is introduced to control the behavior of sea otters in foraging and grooming;a danger factor is introduced to control the behavior of sea otters in feeding and avoiding dangers in the exploitation stage,and the behaviors of sea otters in responding to different dangers are mathematically modeled.The proposed algorithm is compared with 9 well-known intelligent optimization algorithms,and evaluated in 13 benchmark functions as well as wireless sensor network coverage optimization problems to verify the effectiveness of the proposed algorithm.The experimental results show that the node coverage after SOOA optimization reaches 91.2%in 2D environment and 90.47%in 3D environment.Compared with other algorithms,SOOA is superior and possesses the ability to solve complex optimization problems.
基金supported by the National Natural Science Foundation of China under Grant Nos.92265209,11174081 and 62305285the Natural Science Foundation of Chongqing under Grant No.CSTB2024NSCQ-MSX0643the Shanghai Municipal Science and Technology Major Project under Grant No.2019SHZDZX01。
摘要Quantum algorithms offer more enhanced computational efficiency in comparison to their classical counterparts when solving specific tasks.In this study,we implement the quantum permutation algorithm utilizing a polar molecule within an external electric field.The selection of the molecular qutrit involves the utilization of field-dressed states generated through the pendular modes of SrO.Through the application of multi-target optimal control theory,we strategically design microwave pulses to execute logical operations,including Fourier transform,oracle Ufoperation,and inverse Fourier transform within a three-level molecular qutrit structure.The observed high fidelity of our outcomes is intricately linked to the concept of the quantum speed limit,which quantifies the maximum speed of quantum state manipulation.Subsequently,we design the optimized pulse sequence to successfully simulate the quantum permutation algorithm on a single SrO molecule,achieving remarkable fidelity.Consequently,a quantum circuit comprising a single qutrit suffices to determine permutation parity with just a single function evaluation.Therefore,our results indicate that the optimal control theory can be well applied to the quantum computation of polar molecular systems.
基金funded by the Institute of Smart Energy,Huaiyin Institute of Technology,under Grant No.HIT-ISE-2024-07.
摘要In order to address environmental pollution and resource depletion caused by traditional power generation,this paper proposes an adaptive iterative dynamic-balance optimization algorithm that integrates the Improved Dung Beetle Optimizer(IDBO)with VariationalMode Decomposition(VMD).The IDBO-VMD method is designed to enhance the accuracy and efficiency of wind-speed time-series decomposition and to effectively smooth photovoltaic power fluctuations.This study innovatively improves the traditional variational mode decomposition(VMD)algorithm,and significantly improves the accuracy and adaptive ability of signal decomposition by IDBO selfoptimization of key parameters K and a.On this basis,Fourier transform technology is used to define the boundary point between high frequency and low frequency signals,and a targeted energy distribution strategy is proposed:high frequency fluctuations are allocated to supercapacitors to quickly respond to transient power fluctuations;Lowfrequency components are distributed to lead-carbon batteries,optimizing long-term energy storage and scheduling efficiency.This strategy effectively improves the response speed and stability of the energy storage system.The experimental results demonstrate that the IDBO-VMD algorithm markedly outperforms traditional methods in both decomposition accuracy and computational efficiency.Specifically,it effectively reduces the charge–discharge frequency of the battery,prolongs battery life,and optimizes the operating ranges of the state-of-charge(SOC)for both leadcarbon batteries and supercapacitors.In addition,the energy management strategy based on the algorithm not only improves the overall energy utilization efficiency of the system,but also shows excellent performance in the dynamic management and intelligent scheduling of renewable energy generation.
基金supported by the National Natural Science Foundation of China(61503408)。
摘要Frequency diverse array multiple-input multiple-output(FDA-MIMO)radar has gained considerable research attention due to its ability to effectively counter active repeater deception jamming in complex electromagnetic environments.The effectiveness of interference suppression by FDA-MIMO is limited by the inherent range-angle coupling issue in the FDA beampattern.Existing literature primarily focuses on control methods for FDA-MIMO radar beam direction under the assumption of static beampatterns,with insufficient exploration of techniques for managing nonstationary beam directions.To address this gap,this paper initially introduces the FDA-MIMO signal model and the calculation formula for the FDA-MIMO array output using the minimum variance distortionless response(MVDR)beamformer.Building on this,the problem of determining the optimal frequency offset for the FDA is rephrased as a convex optimization problem,which is then resolved using the cuckoo search(CS)algorithm.Simulations confirm the effectiveness of the proposed approach,showing that the frequency offsets obtained through the CS algorithm can create a dot-shaped beam direction at the target location while effectively suppressing interference signals within the mainlobe.
基金the Key Project of the Chongqing Natural Science Foundation(2022NSCQ-LZX0191)the Key Research Program of Science and Technology of the Chongqing Education Commission(KJZD-K202202402)+1 种基金the Scientific Research Start-up Fund of Chongqing University of Posts and Telecommunications(A2023-62)the Chongqing Natural Science Foundation(cstc2024ycjh-bgzxm003)for their invaluable support in this research。
摘要Amplitude Phase Shift Keying(APSK)is more suitable for the nonlinear channels of Low Earth Orbit(LEO)satellite communication systems compared to Quadrature Amplitude Modulation(QAM).To tackle challenges posed by Direct Current(DC)interference and high demodulation complexity,we propose an APSK demodulation algorithm based on K-means clustering.Initially,static DC components are calculated and removed from the received APSK signals.Subsequently,the estimated APSK constellation points serve as initial centers for K-means clustering.These centers are refined through the K-means process and act as theoretical APSK constellation points for the Max-Log-MAP demodulation algorithm,effectively eliminating residual DC.We then introduce a low-complexity APSK demodulation algorithm that utilizes the symmetry of constellation points along with the Euclidean distance between DC-eliminated signals and these constellation points to minimize the set of constellation points.Simulation results indicate that for 32-APSK,our proposed demodulation submodule reduces computational complexity to approximately one-third that of the Max-Log-MAP algorithm while improving Bit Error Rate(BER)performance by about 0.23 dB.Furthermore,end-to-end simulation experiments conducted within LEO satellite communication systems demonstrate that our approach not only maintains this complexity advantage but also enhances BER performance by approximately 1.1 dB.