Hilbert-Huang Transform (HHT) is a newly developed powerful method for nonlinear and non-stationary time series analysis. The empirical mode decomposition is the key part of HHT, while its algorithm was protected by N...Hilbert-Huang Transform (HHT) is a newly developed powerful method for nonlinear and non-stationary time series analysis. The empirical mode decomposition is the key part of HHT, while its algorithm was protected by NASA as a US patent, which limits the wide application among the scientific community. Two approaches, mirror periodic and extrema extending methods, have been developed for handling the end effects of empirical mode decomposition. The implementation of the HHT is realized in detail to widen the application. The detailed comparison of the results from two methods with that from Huang et al. (1998, 1999), and the comparison between two methods are presented. Generally, both methods reproduce faithful results as those of Huang et al. For mirror periodic method (MPM), the data are extended once forever. Ideally, it is a way for handling the end effects of the HHT, especially for the signal that has symmetric waveform. The extrema extending method (EEM) behaves as good as MPM, and it is better than MPM for the signal that has strong asymmetric waveform. However, it has to perform extrema envelope extending in every shifting process.展开更多
Earthquakes are critical triggers for slope instability.While extensive research has been conducted on slope failure modes under seismic loading,the identification of sliding surface propagation and coalescence remain...Earthquakes are critical triggers for slope instability.While extensive research has been conducted on slope failure modes under seismic loading,the identification of sliding surface propagation and coalescence remains insufficiently explored.This study investigates the dynamic response of a deposit slope containing a weak interlayer through large-scale shaking table tests.The propagation process of the sliding surface was identified using the Hilbert-Huang transform and marginal spectrum analysis.Under seismic excitation,sliding occurs along the interface between the overburden and the weak interlayer,leading to sudden landslide events.Differential vibrations at the overburden-weak interlayer-bedrock interfaces are identified as a primary mechanism driving landslide initiation.As input acceleration increases,these interfacial vibration contrasts intensify,and the acceleration amplification effect within the overburden becomes markedly pronounced.Following landslide occurrence,the vibration differences across interfaces decrease sharply.In the time-frequency domain,seismic waves transmitted through the weak interlayer exhibit amplified low-frequency components.Marginal spectrum analysis of seismic energy evolution within the slope reveals that energy attenuation in the 19-22 Hz frequency band correlates with landslide occurrence,while attenuation in the 9-11 Hz band serves as an indicator for sliding surface propagation and coalescence.For seismic design of deposit slopes with weak interlayers,particular attention should be given to the increased seismic inertial forces in the overburden layer and the detrimental effects of low-frequency wave components on sliding surface development.展开更多
Engineering optimization problems are often characterized by high dimensionality,constraints,and complex,multimodal landscapes.Traditional deterministic methods frequently struggle under such conditions,prompting incr...Engineering optimization problems are often characterized by high dimensionality,constraints,and complex,multimodal landscapes.Traditional deterministic methods frequently struggle under such conditions,prompting increased interest in swarm intelligence algorithms.Among these,the Cuckoo Search(CS)algorithm stands out for its promising global search capabilities.However,it often suffers from premature convergence when tackling complex problems.To address this limitation,this paper proposes a Grouped Dynamic Adaptive CS(GDACS)algorithm.Theenhancements incorporated intoGDACS can be summarized into two key aspects.Firstly,a chaotic map is employed to generate initial solutions,leveraging the inherent randomness of chaotic sequences to ensure a more uniform distribution across the search space and enhance population diversity from the outset.Secondly,Cauchy and Levy strategies replace the standard CS population update.This strategy involves evaluating the fitness of candidate solutions to dynamically group the population based on performance.Different step-size adaptation strategies are then applied to distinct groups,enabling an adaptive search mechanism that balances exploration and exploitation.Experiments were conducted on six benchmark functions and four constrained engineering design problems,and the results indicate that the proposed GDACS achieves good search efficiency and produces more accurate optimization results compared with other state-of-the-art algorithms.展开更多
In this paper,we propose a new full-Newton step feasible interior-point algorithm for the special weighted linear complementarity problems.The proposed algorithm employs the technique of algebraic equivalent transform...In this paper,we propose a new full-Newton step feasible interior-point algorithm for the special weighted linear complementarity problems.The proposed algorithm employs the technique of algebraic equivalent transformation to derive the search direction.It is shown that the proximity measure reduces quadratically at each iteration.Moreover,the iteration bound of the algorithm is as good as the best-known polynomial complexity for these types of problems.Furthermore,numerical results are presented to show the efficiency of the proposed algorithm.展开更多
Low-light image enhancement aims to improve the visibility of severely degraded images captured under insufficient illumination,alleviating the adverse effects of illumination degradation on image quality.Traditional ...Low-light image enhancement aims to improve the visibility of severely degraded images captured under insufficient illumination,alleviating the adverse effects of illumination degradation on image quality.Traditional Retinex-based approaches,inspired by human visual perception of brightness and color,decompose an image into illumination and reflectance components to restore fine details.However,their limited capacity for handling noise and complex lighting conditions often leads to distortions and artifacts in the enhanced results,particularly under extreme low-light scenarios.Although deep learning methods built upon Retinex theory have recently advanced the field,most still suffer frominsufficient interpretability and sub-optimal enhancement performance.This paper presents RetinexWT,a novel framework that tightly integrates classical Retinex theory with modern deep learning.Following Retinex principles,RetinexWT employs wavelet transforms to estimate illumination maps for brightness adjustment.A detail-recovery module that synergistically combines Vision Transformer(ViT)and wavelet transforms is then introduced to guide the restoration of lost details,thereby improving overall image quality.Within the framework,wavelet decomposition splits input features into high-frequency and low-frequency components,enabling scale-specific processing of global illumination/color cues and fine textures.Furthermore,a gating mechanism selectively fuses down-sampled and up-sampled features,while an attention-based fusion strategy enhances model interpretability.Extensive experiments on the LOL dataset demonstrate that RetinexWT surpasses existing Retinex-oriented deeplearning methods,achieving an average Peak Signal-to-Noise Ratio(PSNR)improvement of 0.22 dB over the current StateOfTheArt(SOTA),thereby confirming its superiority in low-light image enhancement.Code is available at http://gffzz188fe103f8f1460asxpq69kb5bcpn6bww.ffgz.tsg.suse.edu.cn/CHEN-hJ516/RetinexWT(accessed on 14 October 2025).展开更多
In eld seismic data acquisition,seismic traces are often aected by substantial data gaps and strong noise interference due to environmental and instrumental factors,thus degrading the resolution and signalto-noise rat...In eld seismic data acquisition,seismic traces are often aected by substantial data gaps and strong noise interference due to environmental and instrumental factors,thus degrading the resolution and signalto-noise ratio(SNR)of the seismic profiles.Effective seismic data reconstruction and noise suppression techniques are therefore essential to recover missing signals and improve data quality.In this study,a fast projection onto convex sets(FPOCS)algorithm is proposed by incorporating an inertial parameter that involves a linear combination of the two preceding iterations based on the traditional projection onto convex sets(POCS)algorithm.Then,a weighting factor is introduced to achieve simultaneous data reconstruction and noise suppression using the weighted fast projection onto convex sets(WFPOCS)algorithm.To further suppress residual random noise in the updated solution,an optimization strategy is adopted by swapping the order of the iterative hard thresholding operator and the projection operator.The nal algorithm,termed the improved weighted fast projection onto convex sets(IWFPOCS),achieves high-efciency reconstruction and effective noise suppression.Compared with WFPOCS,the proposed method maintains fast reconstruction speed while demonstrating superior denoising performance on irregularly missing and noisy datasets.Field data experiments conrm that the proposed method signicantly improves the SNR and resolution of seismic data,oering strong practical potential for subsequent processing and interpretation.展开更多
The rapid proliferation of the Internet of Things(IoT)and cyber-physical systems(CPS)within critical infrastructure sectors has significantly expanded the attack surface for advanced and stealthy cyber threats.Since t...The rapid proliferation of the Internet of Things(IoT)and cyber-physical systems(CPS)within critical infrastructure sectors has significantly expanded the attack surface for advanced and stealthy cyber threats.Since these systems increasingly rely on real-time data exchange and autonomous control,developing intelligent,scalable,and adaptive anomaly detection mechanisms has become a pressing requirement.This paper proposes a novel hybrid framework,evolutionary-transformer-long short-term memory(Evo-Transformer-LSTM),that integrates the temporal modeling capability of LSTM networks,the global attention mechanism of Transformer encoders,and the optimization power of the improved chimp optimization algorithm(IChOA)for hyper-parameter tuning.In the proposed architecture,the Transformer encoder extracts high-level contextual patterns from traffic sequences,while the LSTM component captures local temporal dependencies.The framework is rigorously evaluated on four benchmark datasets from the Canadian Institute for Cybersecurity(CIC):CIC-IDS-2017,CSE-CIC-IDS-2018,CIC-IoT-DIAD(2024),and CIC-IoV(2024).Comparative experiments are conducted against several state-of-the-art baselines,including transformer,LSTM,bidirectional encoder representations from transformers(BERT),deep reinforcement learning(DRL),convolutional neural network(CNN),k-nearest neighbors(KNN),and random forest(RF)classifiers.Results show that the proposed Evo-Transformer-LSTM achieves up to 98.25%accuracy,an F1-score of 97.91%,and an area under the curve(AUC)of 99.36%on CIC-IDS 2017,while maintaining above 96%accuracy and 98%AUC even on the more challenging CIC-IoV 2024 dataset,consistently surpassing all baseline models.In addition,statistical significance tests confirm the superiority of the proposed approach.In conclusion,Evo-Transformer-LSTM offers a unified,scalable,and robust solution for anomaly detection in modern IoT and CPS infrastructures,with potential for real-world deployment in security-sensitive domains.展开更多
At present,the quantum approximate optimization algorithm(QAOA)faces scalability challenges in high-dimensional combinatorial optimization problems due to exponentially growing computational costs and reachability def...At present,the quantum approximate optimization algorithm(QAOA)faces scalability challenges in high-dimensional combinatorial optimization problems due to exponentially growing computational costs and reachability deficits for noisy intermediate-scale quantum(NISQ)devices.This study focuses on the multiscale quantum approximate optimization algorithm(MQAOA),which integrates renormalization group(RG)transformations with QAOA to address these limitations.Based on the connections between the variables in the problem to be solved,the weighted maximal matching method is employed to generate a variable partitioning strategy guiding the RG transformation.This approach not only extends the applicability of MQAOA to satisfiability(SAT)problems—including those with three-body and higher-order interactions in the problem Hamiltonian—but also eliminates the algorithm's sensitivity to problem density.Validations conducted on quantum simulators show that,after running two-round MQAOA,its capability is enhanced to identify optimal solutions with approximately 97%success probability as defined by the ground-state overlap for Max-2-SAT problems(78%success probability for Max-3-SAT problems).The results confirm the feasibility of MQAOA and establish it as a resource-efficient framework for complex combinatorial optimization problems,providing a pathway for NISQ-era deployment.展开更多
基金This study is supported by the National Natural Science Foundation of China(NSFC)under contract Nos 49790010,40076010 and 49634140,National Key Basic Research and Development Plan in China under contract No.G1999043701)and the OCEAN-863 Project of China.
摘要Hilbert-Huang Transform (HHT) is a newly developed powerful method for nonlinear and non-stationary time series analysis. The empirical mode decomposition is the key part of HHT, while its algorithm was protected by NASA as a US patent, which limits the wide application among the scientific community. Two approaches, mirror periodic and extrema extending methods, have been developed for handling the end effects of empirical mode decomposition. The implementation of the HHT is realized in detail to widen the application. The detailed comparison of the results from two methods with that from Huang et al. (1998, 1999), and the comparison between two methods are presented. Generally, both methods reproduce faithful results as those of Huang et al. For mirror periodic method (MPM), the data are extended once forever. Ideally, it is a way for handling the end effects of the HHT, especially for the signal that has symmetric waveform. The extrema extending method (EEM) behaves as good as MPM, and it is better than MPM for the signal that has strong asymmetric waveform. However, it has to perform extrema envelope extending in every shifting process.
基金financially supported by the National Key Research&Development Program of China(2025YFE0123800)National Natural Science Foundation of China(No.52372343)+4 种基金Sichuan Transportation Science and Technology Project(2023-A-03)Applied Basic Research Programs of Science and Technology Department in Sichuan Province,China(2022NSFSC1086)Sichuan Science and Technology Program(2024YFHZ0121)the R&D Fund Project of China Academy of Railway Science Corporation Limited(K2024G008)National Natural Science Foundation of China(No.52502430).
摘要Earthquakes are critical triggers for slope instability.While extensive research has been conducted on slope failure modes under seismic loading,the identification of sliding surface propagation and coalescence remains insufficiently explored.This study investigates the dynamic response of a deposit slope containing a weak interlayer through large-scale shaking table tests.The propagation process of the sliding surface was identified using the Hilbert-Huang transform and marginal spectrum analysis.Under seismic excitation,sliding occurs along the interface between the overburden and the weak interlayer,leading to sudden landslide events.Differential vibrations at the overburden-weak interlayer-bedrock interfaces are identified as a primary mechanism driving landslide initiation.As input acceleration increases,these interfacial vibration contrasts intensify,and the acceleration amplification effect within the overburden becomes markedly pronounced.Following landslide occurrence,the vibration differences across interfaces decrease sharply.In the time-frequency domain,seismic waves transmitted through the weak interlayer exhibit amplified low-frequency components.Marginal spectrum analysis of seismic energy evolution within the slope reveals that energy attenuation in the 19-22 Hz frequency band correlates with landslide occurrence,while attenuation in the 9-11 Hz band serves as an indicator for sliding surface propagation and coalescence.For seismic design of deposit slopes with weak interlayers,particular attention should be given to the increased seismic inertial forces in the overburden layer and the detrimental effects of low-frequency wave components on sliding surface development.
基金supported in part by the Ministry of Higher Education Malaysia(MOHE)through Fundamental Research Grant Scheme(FRGS)Ref:FRGS/1/2024/ICT02/UTM/02/10,Vot.No:R.J130000.7828.5F748the Scientific Research Project of Education Department of Hunan Province(Nos.22B1046 and 24A0771).
摘要Engineering optimization problems are often characterized by high dimensionality,constraints,and complex,multimodal landscapes.Traditional deterministic methods frequently struggle under such conditions,prompting increased interest in swarm intelligence algorithms.Among these,the Cuckoo Search(CS)algorithm stands out for its promising global search capabilities.However,it often suffers from premature convergence when tackling complex problems.To address this limitation,this paper proposes a Grouped Dynamic Adaptive CS(GDACS)algorithm.Theenhancements incorporated intoGDACS can be summarized into two key aspects.Firstly,a chaotic map is employed to generate initial solutions,leveraging the inherent randomness of chaotic sequences to ensure a more uniform distribution across the search space and enhance population diversity from the outset.Secondly,Cauchy and Levy strategies replace the standard CS population update.This strategy involves evaluating the fitness of candidate solutions to dynamically group the population based on performance.Different step-size adaptation strategies are then applied to distinct groups,enabling an adaptive search mechanism that balances exploration and exploitation.Experiments were conducted on six benchmark functions and four constrained engineering design problems,and the results indicate that the proposed GDACS achieves good search efficiency and produces more accurate optimization results compared with other state-of-the-art algorithms.
基金Supported by the Optimisation Theory and Algorithm Research Team(Grant No.23kytdzd004)University Science Research Project of Anhui Province(Grant No.2024AH050631)the General Programs for Young Teacher Cultivation of Educational Commission of Anhui Province(Grant No.YQYB2023090).
摘要In this paper,we propose a new full-Newton step feasible interior-point algorithm for the special weighted linear complementarity problems.The proposed algorithm employs the technique of algebraic equivalent transformation to derive the search direction.It is shown that the proximity measure reduces quadratically at each iteration.Moreover,the iteration bound of the algorithm is as good as the best-known polynomial complexity for these types of problems.Furthermore,numerical results are presented to show the efficiency of the proposed algorithm.
基金supported in part by the National Natural Science Foundation of China[Grant number 62471075]the Major Science and Technology Project Grant of the Chongqing Municipal Education Commission[Grant number KJZD-M202301901].
摘要Low-light image enhancement aims to improve the visibility of severely degraded images captured under insufficient illumination,alleviating the adverse effects of illumination degradation on image quality.Traditional Retinex-based approaches,inspired by human visual perception of brightness and color,decompose an image into illumination and reflectance components to restore fine details.However,their limited capacity for handling noise and complex lighting conditions often leads to distortions and artifacts in the enhanced results,particularly under extreme low-light scenarios.Although deep learning methods built upon Retinex theory have recently advanced the field,most still suffer frominsufficient interpretability and sub-optimal enhancement performance.This paper presents RetinexWT,a novel framework that tightly integrates classical Retinex theory with modern deep learning.Following Retinex principles,RetinexWT employs wavelet transforms to estimate illumination maps for brightness adjustment.A detail-recovery module that synergistically combines Vision Transformer(ViT)and wavelet transforms is then introduced to guide the restoration of lost details,thereby improving overall image quality.Within the framework,wavelet decomposition splits input features into high-frequency and low-frequency components,enabling scale-specific processing of global illumination/color cues and fine textures.Furthermore,a gating mechanism selectively fuses down-sampled and up-sampled features,while an attention-based fusion strategy enhances model interpretability.Extensive experiments on the LOL dataset demonstrate that RetinexWT surpasses existing Retinex-oriented deeplearning methods,achieving an average Peak Signal-to-Noise Ratio(PSNR)improvement of 0.22 dB over the current StateOfTheArt(SOTA),thereby confirming its superiority in low-light image enhancement.Code is available at http://gffzz188fe103f8f1460asxpq69kb5bcpn6bww.ffgz.tsg.suse.edu.cn/CHEN-hJ516/RetinexWT(accessed on 14 October 2025).
基金supported in part by the Foundation of National Key Laboratory of Uranium Resources Exploration-Mining and Nuclear Remote Sensing under Grant 2024QZ-TD-13in part by the National Natural Science Foundation of China under Grant 42564006+1 种基金in part by the Natural Science Foundation of Jiangxi Province under Grant 20242BAB26051in part by the Open Fund of SINOPEC Key Laboratory of Geophysics,and in part by support the plan of Ganpo Juncai under Grant 20243BCE51012.
摘要In eld seismic data acquisition,seismic traces are often aected by substantial data gaps and strong noise interference due to environmental and instrumental factors,thus degrading the resolution and signalto-noise ratio(SNR)of the seismic profiles.Effective seismic data reconstruction and noise suppression techniques are therefore essential to recover missing signals and improve data quality.In this study,a fast projection onto convex sets(FPOCS)algorithm is proposed by incorporating an inertial parameter that involves a linear combination of the two preceding iterations based on the traditional projection onto convex sets(POCS)algorithm.Then,a weighting factor is introduced to achieve simultaneous data reconstruction and noise suppression using the weighted fast projection onto convex sets(WFPOCS)algorithm.To further suppress residual random noise in the updated solution,an optimization strategy is adopted by swapping the order of the iterative hard thresholding operator and the projection operator.The nal algorithm,termed the improved weighted fast projection onto convex sets(IWFPOCS),achieves high-efciency reconstruction and effective noise suppression.Compared with WFPOCS,the proposed method maintains fast reconstruction speed while demonstrating superior denoising performance on irregularly missing and noisy datasets.Field data experiments conrm that the proposed method signicantly improves the SNR and resolution of seismic data,oering strong practical potential for subsequent processing and interpretation.
摘要The rapid proliferation of the Internet of Things(IoT)and cyber-physical systems(CPS)within critical infrastructure sectors has significantly expanded the attack surface for advanced and stealthy cyber threats.Since these systems increasingly rely on real-time data exchange and autonomous control,developing intelligent,scalable,and adaptive anomaly detection mechanisms has become a pressing requirement.This paper proposes a novel hybrid framework,evolutionary-transformer-long short-term memory(Evo-Transformer-LSTM),that integrates the temporal modeling capability of LSTM networks,the global attention mechanism of Transformer encoders,and the optimization power of the improved chimp optimization algorithm(IChOA)for hyper-parameter tuning.In the proposed architecture,the Transformer encoder extracts high-level contextual patterns from traffic sequences,while the LSTM component captures local temporal dependencies.The framework is rigorously evaluated on four benchmark datasets from the Canadian Institute for Cybersecurity(CIC):CIC-IDS-2017,CSE-CIC-IDS-2018,CIC-IoT-DIAD(2024),and CIC-IoV(2024).Comparative experiments are conducted against several state-of-the-art baselines,including transformer,LSTM,bidirectional encoder representations from transformers(BERT),deep reinforcement learning(DRL),convolutional neural network(CNN),k-nearest neighbors(KNN),and random forest(RF)classifiers.Results show that the proposed Evo-Transformer-LSTM achieves up to 98.25%accuracy,an F1-score of 97.91%,and an area under the curve(AUC)of 99.36%on CIC-IDS 2017,while maintaining above 96%accuracy and 98%AUC even on the more challenging CIC-IoV 2024 dataset,consistently surpassing all baseline models.In addition,statistical significance tests confirm the superiority of the proposed approach.In conclusion,Evo-Transformer-LSTM offers a unified,scalable,and robust solution for anomaly detection in modern IoT and CPS infrastructures,with potential for real-world deployment in security-sensitive domains.
基金supported by the National Natural Science Foundation of China(Grant Nos.62371199 and 62071186)Guangdong Provincial Quantum Science Strategic Initiative(Grant Nos.GDZX2303007 and GDZX2305001)。
摘要At present,the quantum approximate optimization algorithm(QAOA)faces scalability challenges in high-dimensional combinatorial optimization problems due to exponentially growing computational costs and reachability deficits for noisy intermediate-scale quantum(NISQ)devices.This study focuses on the multiscale quantum approximate optimization algorithm(MQAOA),which integrates renormalization group(RG)transformations with QAOA to address these limitations.Based on the connections between the variables in the problem to be solved,the weighted maximal matching method is employed to generate a variable partitioning strategy guiding the RG transformation.This approach not only extends the applicability of MQAOA to satisfiability(SAT)problems—including those with three-body and higher-order interactions in the problem Hamiltonian—but also eliminates the algorithm's sensitivity to problem density.Validations conducted on quantum simulators show that,after running two-round MQAOA,its capability is enhanced to identify optimal solutions with approximately 97%success probability as defined by the ground-state overlap for Max-2-SAT problems(78%success probability for Max-3-SAT problems).The results confirm the feasibility of MQAOA and establish it as a resource-efficient framework for complex combinatorial optimization problems,providing a pathway for NISQ-era deployment.