Multi-agent reinforcement learning(MARL)has proven its effectiveness in cooperative multi-agent systems(MASs)but still faces issues on the curse of dimensionality and learning efficiency.The main difficulty is caused ...Multi-agent reinforcement learning(MARL)has proven its effectiveness in cooperative multi-agent systems(MASs)but still faces issues on the curse of dimensionality and learning efficiency.The main difficulty is caused by the strong inter-agent coupling nature embedded in an MARL problem,which is yet to be fully exploited in existing algorithms.In this work,we recognize a learning graph characterizing the dependence between individual rewards and individual policies.Then we propose a graph-based reward aggregation(GRA)method,which utilizes the inherent coupling relationship among agents to eliminate redundant information.Specifically,GRA passes information among cooperating agents through graph attention networks to obtain aggregated rewards that contribute to the fitting of the value function,making each agent learn a decentralized executable cooperation policy.In addition,we propose a variant of GRA,named GRA-decen,which achieves decentralized training and decentralized execution(DTDE)when each agent only has access to information of partial agents in the learning process.We conduct experiments in different environments and demonstrate the practicality and scalability of our algorithms.展开更多
Owing to the constraints of depth sensing technology,images acquired by depth cameras are inevitably mixed with various noises.For depth maps presented in gray values,this research proposes a novel denoising model,ter...Owing to the constraints of depth sensing technology,images acquired by depth cameras are inevitably mixed with various noises.For depth maps presented in gray values,this research proposes a novel denoising model,termed graph-based transform(GBT)and dual graph Laplacian regularization(DGLR)(DGLR-GBT).This model specifically aims to remove Gaussian white noise by capitalizing on the nonlocal self-similarity(NSS)and the piecewise smoothness properties intrinsic to depth maps.Within the group sparse coding(GSC)framework,a combination of GBT and DGLR is implemented.Firstly,within each group,the graph is constructed by using estimates of the true values of the averaged blocks instead of the observations.Secondly,the graph Laplacian regular terms are constructed based on rows and columns of similar block groups,respectively.Lastly,the solution is obtained effectively by combining the alternating direction multiplication method(ADMM)with the weighted thresholding method within the domain of GBT.展开更多
This study systematically investigated the influence of deposition rate on the structure,broadband opti⁃cal properties(1.0-13.0μm),and stress characteristics of Germanium(Ge)films.Additionally,a method for enhancing ...This study systematically investigated the influence of deposition rate on the structure,broadband opti⁃cal properties(1.0-13.0μm),and stress characteristics of Germanium(Ge)films.Additionally,a method for enhancing the performance of infrared filters based on rate-modulated deposition of Ge films was proposed.The optical absorption of Ge films in the short-wave infrared(SWIR)and long-wave infrared(LWIR)bands can be effectively reduced by modulating the deposition rate.As the deposition rate increases,the Ge films maintain an amorphous structure.The optical constants of the films in the 1.0-2.5μm and 2.5-13.0μm bands were precisely determined using the Cody-Lorentz model and the classical Lorentz oscillator model,respectively.Notably,high⁃er deposition rates result in a gradual increase in the refractive index.The extinction coefficient increases with the deposition rate in the SWIR region,attributed to the widening of the Urbach tail,while it decreases in the LWIR region due to the reduced absorption caused by the Ge-O stretching mode.Additionally,the films exhibit a tensile stress that decreases with increasing deposition rate.Finally,the effectiveness of the proposed fabrication method for an infrared filter with Ge films deposited at an optimized rate was demonstrated through practical examples.This work provides theoretical and technical support for the application of Ge films in high-performance infrared filters.展开更多
The Savitzky-Golay(SG)filter,which employs polynomial least-squares approximations to smooth data and estimate derivatives,is widely used for processing noisy data.However,noise suppression by the SG filter is recogni...The Savitzky-Golay(SG)filter,which employs polynomial least-squares approximations to smooth data and estimate derivatives,is widely used for processing noisy data.However,noise suppression by the SG filter is recognized to be limited at data boundaries and high frequencies,which can significantly reduce the signal-to-noise ratio(SNR).To solve this problem,a novel method synergistically integrating Principal Component Analysis(PCA)with SG filtering is proposed in this paper.This approach avoids the is-sue of excessive smoothing associated with larger window sizes.The proposed PCA-SG filtering algorithm was applied to a CO gas sensing system based on Cavity Ring-Down Spectroscopy(CRDS).The perform-ance of the PCA-SG filtering algorithm is demonstrated through comparison with Moving Average Filtering(MAF),Wavelet Transformation(WT),Kalman Filtering(KF),and the SG filter.The results demonstrate that the proposed algorithm exhibits superior noise reduction capabilities compared to the other algorithms evaluated.The SNR of the ring-down signal was improved from 11.8612 dB to 29.0913 dB,and the stand-ard deviation of the extracted ring-down time constant was reduced from 0.037μs to 0.018μs.These results confirm that the proposed PCA-SG filtering algorithm effectively improves the smoothness of the ring-down curve data,demonstrating its feasibility.展开更多
Accurate estimation of the State of Charge(SOC),State of Health(SOH),and Terminal Resistance(TR)is crucial for the effective operation of Battery Management Systems(BMS)in lithium-ion batteries.This study conducts a c...Accurate estimation of the State of Charge(SOC),State of Health(SOH),and Terminal Resistance(TR)is crucial for the effective operation of Battery Management Systems(BMS)in lithium-ion batteries.This study conducts a comprehensive comparative analysis of four Kalman filter variants Extended Kalman Filter(EKF),Extended Kalman-Bucy Filter(EKBF),Unscented Kalman Filter(UKF),and Unscented Kalman-Bucy Filter(UKBF)under varying battery parameter conditions.These include temperature fluctuation,self-discharge,current direction,cell capacity,process noise,and measurement noise.Our findings reveal significant variations in the performance of SOC and SOH predictions across filters,emphasizing that UKF demonstrates superior robustness to noise,while EKF performs better under accurate system dynamics.The study underscores the need for adaptive filtering strategies that can dynamically adjust to evolving battery parameters,thereby enhancing BMS reliability and extending battery lifespan.展开更多
1 Introduction Recently,the increasing demand for advanced telecommunication systems has spurred extensive research into bandpass filters(BPFs),with particular emphasis on miniaturization,reduction of insertion loss(I...1 Introduction Recently,the increasing demand for advanced telecommunication systems has spurred extensive research into bandpass filters(BPFs),with particular emphasis on miniaturization,reduction of insertion loss(IL),and enhancement of upper stopband rejection(Huang et al.,2021;Snyder et al.,2021;Lin et al.,2023;Zeng et al.,2023).展开更多
In this study,a fifth-degree cubature particle filter(5CPF)is proposed to address the limited estimation accuracy in traditional particle filter algorithms for bearings-only tracking(BOT).This algorithm calculates the...In this study,a fifth-degree cubature particle filter(5CPF)is proposed to address the limited estimation accuracy in traditional particle filter algorithms for bearings-only tracking(BOT).This algorithm calculates the recommended density function by introducing a fifth-degree cubature Kalman filter algorithm to guide particle sampling,which effectively alleviates the problem of particle degradation and significantly improves the estimation accuracy of the filter.However,the 5CPF algorithm exhibits high computational complexity,particularly in scenarios with a large number of particles.Therefore,we propose the extended Kalman filter(EKF)-5CPF algorithm,which employs an EKF to replace the time update step for each particle in the 5CPF.This enhances the algorithm’s real-time capability while maintaining the high precision advantage of the 5CPF algorithm.In addition,we construct bearing-only dual-station and single-motion station target tracking systems,and the filtering performances of 5CPF and EKF-5CPF algorithms under different conditions are analyzed.The results show that both the 5CPF algorithm and EKF-5CPF have strong robustness and can adapt to different noise environments.Furthermore,both algorithms significantly outperform traditional nonlinear filtering algorithms in terms of convergence speed,tracking accuracy,and overall stability.展开更多
Color filters are essential components for optical modulation.However,conventional filters are restricted to operating exclusively in either reflective or transmissive mode.Furthermore,they suffer from limited UV and ...Color filters are essential components for optical modulation.However,conventional filters are restricted to operating exclusively in either reflective or transmissive mode.Furthermore,they suffer from limited UV and thermal stability,low color purity,and exhibit identical coloration on both surfaces.Herein,we propose a novel design strategy for trans-reflective color filters by integrating the absorptive properties of dye-doped polysulfone(PSU)with the diffractive capabilities of photonic crystals.This composite filter achieved broad-spectrum transmission with deep color outputs—yellow(0.410,0.510),magenta(0.446,0.231),and cyan(0.201,0.425)—closely aligned with standard color space coordinates.By tuning the refractive index of CeO_(2)@SiO_(2)nanoparticles to match dye-based PSU matrix,the transmittance of filters exceeded 70%.Moreover,dye-mediated absorption reduces the scattering light,thereby enhancing reflection color purity(full width at half maxima(FWHM)=25 nm)and producing vibrant blue,green,and red hues.The incorporation of UV-absorbing CeO_(2)@SiO_(2)nanoparticles effectively mitigated dye photodegradation,yielding exceptional UV stability(ΔT<2%under prolonged UV exposure).The filters also exhibited outstanding thermal stability(ΔT<1%after 30 min heat treatment at 230°C).This work establishes a robust materials design framework for multifunctional optical filters,advancing the development of highfidelity dual-mode color systems for next-generation display technologies.展开更多
Recommendation systems are an integral and indispensable part of every digital platform,as they can suggest content or items to users based on their respective needs.Collaborative filtering is a technique often used i...Recommendation systems are an integral and indispensable part of every digital platform,as they can suggest content or items to users based on their respective needs.Collaborative filtering is a technique often used in various studies,which produces recommendations by analyzing similarities between users and items based on their behavior.Although often used,traditional collaborative filtering techniques still face the main challenge of sparsity.Sparsity problems occur when the data in the system is sparse,meaning that only a portion of users provide feedback on some items,resulting in inaccurate recommendations generated by the system.To overcome this problem,we developed aHybrid Collaborative Filtering model based onMatrix Factorization andGradient Boosting(HCF-MFGB),a new hybrid approach.Our proposed model integrates SVD++,the XGBoost ensemble learning algorithm,and utilizes user demographic data and meta items.We utilize information,both explicitly and implicitly,to learn user preference patterns using SVD++.The XGBoost algorithm is used to create hundreds of decision trees incrementally,thereby improving model accuracy.Meanwhile,user demographic and meta-item data are clustered using the K-Means Clustering algorithm to capture similarities in user and item characteristics.This combination is designed to improve rating prediction accuracy by reducing reliance on minimal explicit rating data,while addressing sparsity issues in movie recommendation systems.The results of experiments on the MovieLens 100K,MovieLens 1M,and CiaoDVD datasets show significant improvements,outperforming various other baselinemodels in terms of RMSE and MAE.On theMovieLens 100K dataset,the HCF-MFGB model obtained an RMSE value of 0.853 and an MAE value of 0.674.On theMovieLens 1M dataset,the HCF-MFGB model obtained an RMSE value of 0.763 and an MAE value of 0.61.On the CiaoDCD dataset,the HCF-MFGB model achieved an RMSE value of 0.718 and an MAE value of 0.495.These results confirm a significant improvement in movie recommendation accuracy with the proposed approach.展开更多
This article presents an adaptive intelligent control strategy applied to a lumped-parameter evaporator model,i.e.,a simplified dynamic representation treating the evaporator as a single thermal node with uniform temp...This article presents an adaptive intelligent control strategy applied to a lumped-parameter evaporator model,i.e.,a simplified dynamic representation treating the evaporator as a single thermal node with uniform temperature distribution,suitable for control design due to its balance between physical fidelity and computational simplicity.The controller uses a wavelet-based neural proportional,integral,derivative(PID)controller with IIR filtering(infinite impulse response).The dynamic model captures the essential heat and mass transfer phenomena through a nonlinear energy balance,where the cooling capacity“Qevap”is expressed as a non-linear function of the compressor frequency and the temperature difference,specifically,Q_(evap)=k_(1)u(T_(in)−T_(e))with u as compressor frequency,Te evaporator temperature,and Tin inlet fluid temperature.The operating conditions of the system,in general terms,focus on the following variables,the overall thermal capacity is 1000 J/K,typical for small-capacity heat exchangers,The mass flow is 0.05 kg/s,typical for secondary liquid cooling circuits,the overall loss coefficient of 50 W/K that corresponds to small evaporators with partial insulation,the temperatures(inlet)of 10℃and the temperature of environment of 25℃,thermal load of 200 W that corresponds to a small-scaled air conditioning applications.To handle system nonlinearities and improve control performance,aMorlet wavelet-based neural network(Wavenet)is used to dynamically adjust the PID gains online.An IIR filter is incorporated to smooth the adaptive gains,improving stability and reducing oscillations.In contrast to prior wavelet-or neural-adaptive PID controllers in HVAC applications,which typically adjust gains without explicit filtering or not tailored to evaporator dynamics,this work introduces the first PID–Wavenet scheme augmented with an IIR-based stabilization layer,specifically designed to address the combined challenges of nonlinear evaporator behavior,gain oscillation,and real-time implementability.The proposed controller(PID-Wavenet+IIR)is implemented and validated inMATLAB/Simulink,demonstrating superior performance compared to a conventional PID tuned using Simulink’s auto-tuning function.Key results include a reduction in settling time from 13.3 to 8.2 s,a reduction in overshoot from 3.5%to 0.8%,a reduction in steady-state error from 0.12℃ to 0.02℃and a 13%reduction in energy overall consumption.The controller also exhibits greater robustness and adaptability under varying thermal loads.This explicit integration of wavelet-driven adaptation with IIR-filtered gain shaping constitutes the main methodological contribution and novelty of the work.These findings validate the effectiveness of the wavelet-based adaptive approach for advanced thermal management in refrigeration and HVAC systems,with potential applications in controlling variable-speed compressors,liquid chillers,and compact cooling units.展开更多
This article proposes a generalized strongly coupled resonator quartet(GSCRQ)filter along with its synthesis approach.By introducing out-of-band reflection zeros(RZs),the proposed GSCRQ can generate a transmission zer...This article proposes a generalized strongly coupled resonator quartet(GSCRQ)filter along with its synthesis approach.By introducing out-of-band reflection zeros(RZs),the proposed GSCRQ can generate a transmission zero on each side of the passband without negative couplings.The coupling coefficients in this coupling structure change with the positions of the out-of-band RZs.Thus,the GSCRQ configuration admits flexible design solutions.For GSCRQ coaxial combline filters,all couplings can be implemented as inductive couplings,simplifying the design and manufacturing process.In this article,a 6-2 filter in the GSCRQ configuration is synthesized and designed.The simulated results of the designed filter agree very well with the theoretical characteristics.展开更多
Deep graph contrastive clustering has attracted widespread attentions due to its self-supervised representation learning paradigm and superior clustering performance.Although,two challenges emerge and result in high c...Deep graph contrastive clustering has attracted widespread attentions due to its self-supervised representation learning paradigm and superior clustering performance.Although,two challenges emerge and result in high computational costs.Most existing contrastive methods adopt the data augmentation and then representation learning strategy,where representation learning with trainable graph convolution is coupled with complex and fixed data augmentation,inevitably limiting the efficiency and flexibility.The similarity metric between positive-negative sample pairs is complex and contrastive objective is partial,limiting the discriminability of representation learning.To solve these challenges,a novel wide graph clustering network(WGCN)adhering to representation and then augmentation framework is proposed,which mainly consists of multiorder filter fusion(MFF)and double-level contrastive learning(DCL)modules.Specifically,the MFF module integrates multiorder low-pass filters to extract smooth and multi-scale topological features,utilizing self-attention fusion to reduce redundancy and obtain comprehensive embedding representation.Further,the DCL module constructs two augmented views by the parallel parameter-unshared Siamese encoders rather than complex augmentations on graph.To achieve simple yet effective self-supervised learning,representation self-supervision and structural consistency oriented double-level contrastive loss is designed,where representation self-supervision maximizes the agreement between pairwise augmented embedding representations and structural consistency promotes the mutual information correlation between appending neighborhoods with similar semantics.Extensive experiments on six benchmark datasets demonstrate the superiority of the proposed WGCN,especially highlighting its time-saving characteristic.The code could be available in the https://github.com/Tianxiang Zhao0474/WGCN.展开更多
In this study, we used the multi-resolution graph-based clustering （MRGC） method for determining the electrofacies （EF） and lithofacies （LF） from well log data obtained from the intraplatform bank gas fields loc...In this study, we used the multi-resolution graph-based clustering （MRGC） method for determining the electrofacies （EF） and lithofacies （LF） from well log data obtained from the intraplatform bank gas fields located in the Amu Darya Basin. The MRGC could automatically determine the optimal number of clusters without prior knowledge about the structure or cluster numbers of the analyzed data set and allowed the users to control the level of detail actually needed to define the EF. Based on the LF identification and successful EF calibration using core data, an MRGC EF partition model including five clusters and a quantitative LF interpretation chart were constructed. The EF clusters 1 to 5 were interpreted as lagoon, anhydrite flat, interbank, low-energy bank, and high-energy bank, and the coincidence rate in the cored interval could reach 85%. We concluded that the MRGC could be accurately applied to predict the LF in non-cored but logged wells. Therefore, continuous EF clusters were partitioned and corresponding LF were characteristics ＆different LF were analyzed interpreted, and the distribution and petrophysical in the framework of sequence stratigraphy.展开更多
A better understanding of the relationship between the structure and functions of urban and suburban spaces is one of the avenues of research still open for geographical information science.The research presented in t...A better understanding of the relationship between the structure and functions of urban and suburban spaces is one of the avenues of research still open for geographical information science.The research presented in this paper develops several graph-based metrics whose objective is to characterize some local and global structural properties that reflect the way the overall building layout can be cross-related to the one of the road layout.Such structural properties are modeled as an aggregation of parcels,buildings,and road networks.We introduce several computational measures(Ratio Minimum Distance,Minimum Ratio Minimum Distance,and Metric Compactness)that respectively evaluate the capability for a given road to be connected with the whole road network.These measures reveal emerging sub-network structures and point out differences between less-connective and moreconnective parts of the network.Based on these local and global properties derived from the topological and graph-based representation,and on building density metrics,this paper proposes an analysis of road and building layouts at different levels of granularity.The metrics developed are applied to a case study in which the derived properties reveal coherent as well as incoherent neighborhoods that illustrate the potential of the approach and the way buildings and roads can be relatively connected in a given urban environment.Overall,and by integrating the parcels and buildings layouts,this approach complements other previous and related works that mainly retain the configurational structure of the urban network as well as morphological studies whose focus is generally limited to the analysis of the building layout.展开更多
Simultaneous localization and mapping(SLAM)is widely used in many robot applications to acquire the unknown environment's map and the robots location.Graph-based SLAM is demonstrated to be effective in large-scale...Simultaneous localization and mapping(SLAM)is widely used in many robot applications to acquire the unknown environment's map and the robots location.Graph-based SLAM is demonstrated to be effective in large-scale scenarios,and it intuitively performs the SLAM as a pose graph.But because of the high data overlap rate,traditional graph-based SLAM is not efficient in some respects,such as real time performance and memory usage.To reduce1 data overlap rate,a graph-based SLAM with distributed submap strategy(DSS)is presented.In its front-end,submap based scan matching is processed and loop closing detection is conducted.Moreover in its back-end,pose graph is updated for global optimization and submap merging.From a series of experiments,it is demonstrated that graph-based SLAM with DSS reduces 51.79%data overlap rate,decreases 39.70%runtime and 24.60%memory usage.The advantages over other low overlap rate method is also proved in runtime,memory usage,accuracy and robustness performance.展开更多
The number of botnet malware attacks on Internet devices has grown at an equivalent rate to the number of Internet devices that are connected to the Internet.Bot detection using machine learning(ML)with flow-based fea...The number of botnet malware attacks on Internet devices has grown at an equivalent rate to the number of Internet devices that are connected to the Internet.Bot detection using machine learning(ML)with flow-based features has been extensively studied in the literature.Existing flow-based detection methods involve significant computational overhead that does not completely capture network communication patterns that might reveal other features ofmalicious hosts.Recently,Graph-Based Bot Detection methods using ML have gained attention to overcome these limitations,as graphs provide a real representation of network communications.The purpose of this study is to build a botnet malware detection system utilizing centrality measures for graph-based botnet detection and ML.We propose BotSward,a graph-based bot detection system that is based on ML.We apply the efficient centrality measures,which are Closeness Centrality(CC),Degree Centrality(CC),and PageRank(PR),and compare them with others used in the state-of-the-art.The efficiency of the proposed method is verified on the available Czech Technical University 13 dataset(CTU-13).The CTU-13 dataset contains 13 real botnet traffic scenarios that are connected to a command-and-control(C&C)channel and that cause malicious actions such as phishing,distributed denial-of-service(DDoS)attacks,spam attacks,etc.BotSward is robust to zero-day attacks,suitable for large-scale datasets,and is intended to produce better accuracy than state-of-the-art techniques.The proposed BotSward solution achieved 99%accuracy in botnet attack detection with a false positive rate as low as 0.0001%.展开更多
Maximizing network lifetime is measured as the primary issue in Mobile Ad-hoc Networks(MANETs).In geographically routing based models,packet transmission seems to be more appropriate in dense circumstances.The involve...Maximizing network lifetime is measured as the primary issue in Mobile Ad-hoc Networks(MANETs).In geographically routing based models,packet transmission seems to be more appropriate in dense circumstances.The involvement of the Heuristic model directly is not appropriate to offer an effectual solution as it becomes NP-hard issues;therefore investigators concentrate on using Meta-heuristic approaches.Dragonfly Optimization(DFO)is an effective meta-heuristic approach to resolve these problems by providing optimal solutions.Moreover,Meta-heuristic approaches(DFO)turn to be slower in convergence problems and need proper computational time while expanding network size.Thus,DFO is adaptively improved as Adaptive Dragonfly Optimization(ADFO)to fit this model and re-formulated using graph-based m-connection establishment(G-𝑚𝑚CE)to overcome computational time and DFO’s convergence based problems,considerably enhancing DFO performance.In(G-𝑚𝑚CE),Connectivity Zone(CZ)is chosen among source to destination in which optimality should be under those connected regions and ADFO is used for effective route establishment in CZ indeed of complete networking model.To measure complementary features of ADFO and(G-𝑚𝑚CE),hybridization of DFO-(G-𝑚𝑚CE)is anticipated over dense circumstances with reduced energy consumption and delay to enhance network lifetime.The simulation was performed in MATLAB environment.展开更多
Active learning in semi-supervised classification involves introducing additional labels for unlabelled data to improve the accuracy of the underlying classifier.A challenge is to identify which points to label to bes...Active learning in semi-supervised classification involves introducing additional labels for unlabelled data to improve the accuracy of the underlying classifier.A challenge is to identify which points to label to best improve performance while limiting the number of new labels."Model Change"active learning quantifies the resulting change incurred in the classifier by introducing the additional label(s).We pair this idea with graph-based semi-supervised learning(SSL)methods,that use the spectrum of the graph Laplacian matrix,which can be truncated to avoid prohibitively large computational and storage costs.We consider a family of convex loss functions for which the acquisition function can be efficiently approximated using the Laplace approximation of the posterior distribution.We show a variety of multiclass examples that illustrate improved performance over prior state-of-art.展开更多
Many cutting-edge methods are now possible in real-time commercial settings and are growing in popularity on cloud platforms.By incorporating new,cutting-edge technologies to a larger extent without using more infrast...Many cutting-edge methods are now possible in real-time commercial settings and are growing in popularity on cloud platforms.By incorporating new,cutting-edge technologies to a larger extent without using more infrastructures,the information technology platform is anticipating a completely new level of devel-opment.The following concepts are proposed in this research paper:1)A reliable authentication method Data replication that is optimised;graph-based data encryp-tion and packing colouring in Redundant Array of Independent Disks(RAID)sto-rage.At the data centre,data is encrypted using crypto keys called Key Streams.These keys are produced using the packing colouring method in the web graph’s jump graph.In order to achieve space efficiency,the replication is carried out on optimised many servers employing packing colours.It would be thought that more connections would provide better authentication.This study provides an innovative architecture with robust security,enhanced authentication,and low cost.展开更多
The surge of large-scale models in recent years has led to breakthroughs in numerous fields,but it has also introduced higher computational costs and more complex network architectures.These increasingly large and int...The surge of large-scale models in recent years has led to breakthroughs in numerous fields,but it has also introduced higher computational costs and more complex network architectures.These increasingly large and intricate networks pose challenges for deployment and execution while also exacerbating the issue of network over-parameterization.To address this issue,various network compression techniques have been developed,such as network pruning.A typical pruning algorithm follows a three-step pipeline involving training,pruning,and retraining.Existing methods often directly set the pruned filters to zero during retraining,significantly reducing the parameter space.However,this direct pruning strategy frequently results in irreversible information loss.In the early stages of training,a network still contains much uncertainty,and evaluating filter importance may not be sufficiently rigorous.To manage the pruning process effectively,this paper proposes a flexible neural network pruning algorithm based on the logistic growth differential equation,considering the characteristics of network training.Unlike other pruning algorithms that directly reduce filter weights,this algorithm introduces a three-stage adaptive weight decay strategy inspired by the logistic growth differential equation.It employs a gentle decay rate in the initial training stage,a rapid decay rate during the intermediate stage,and a slower decay rate in the network convergence stage.Additionally,the decay rate is adjusted adaptively based on the filter weights at each stage.By controlling the adaptive decay rate at each stage,the pruning of neural network filters can be effectively managed.In experiments conducted on the CIFAR-10 and ILSVRC-2012 datasets,the pruning of neural networks significantly reduces the floating-point operations while maintaining the same pruning rate.Specifically,when implementing a 30%pruning rate on the ResNet-110 network,the pruned neural network not only decreases floating-point operations by 40.8%but also enhances the classification accuracy by 0.49%compared to the original network.展开更多
基金supported in part by the National Natural Science Foundation of China(grants 62203073 and 62573068)the Natural Science Foundation of Chongqing,China(grant CSTB2022NSCQMSX0577)。
文摘Multi-agent reinforcement learning(MARL)has proven its effectiveness in cooperative multi-agent systems(MASs)but still faces issues on the curse of dimensionality and learning efficiency.The main difficulty is caused by the strong inter-agent coupling nature embedded in an MARL problem,which is yet to be fully exploited in existing algorithms.In this work,we recognize a learning graph characterizing the dependence between individual rewards and individual policies.Then we propose a graph-based reward aggregation(GRA)method,which utilizes the inherent coupling relationship among agents to eliminate redundant information.Specifically,GRA passes information among cooperating agents through graph attention networks to obtain aggregated rewards that contribute to the fitting of the value function,making each agent learn a decentralized executable cooperation policy.In addition,we propose a variant of GRA,named GRA-decen,which achieves decentralized training and decentralized execution(DTDE)when each agent only has access to information of partial agents in the learning process.We conduct experiments in different environments and demonstrate the practicality and scalability of our algorithms.
基金National Natural Science Foundation of China(No.62372100)。
文摘Owing to the constraints of depth sensing technology,images acquired by depth cameras are inevitably mixed with various noises.For depth maps presented in gray values,this research proposes a novel denoising model,termed graph-based transform(GBT)and dual graph Laplacian regularization(DGLR)(DGLR-GBT).This model specifically aims to remove Gaussian white noise by capitalizing on the nonlocal self-similarity(NSS)and the piecewise smoothness properties intrinsic to depth maps.Within the group sparse coding(GSC)framework,a combination of GBT and DGLR is implemented.Firstly,within each group,the graph is constructed by using estimates of the true values of the averaged blocks instead of the observations.Secondly,the graph Laplacian regular terms are constructed based on rows and columns of similar block groups,respectively.Lastly,the solution is obtained effectively by combining the alternating direction multiplication method(ADMM)with the weighted thresholding method within the domain of GBT.
基金Supported by the National Natural Science Foundation of China(62275053,62275256)the National key Research and Development Program of China(2021YFB3701500)+1 种基金the Youth Innovation Promotion Association of the Chinese Academy of Sciences(2023248)the Eastern Talent Plan Youth Project 2022,the Shanghai Key Laboratory of Optical Coatings and Spectral Modulation(23dz2260500).
文摘This study systematically investigated the influence of deposition rate on the structure,broadband opti⁃cal properties(1.0-13.0μm),and stress characteristics of Germanium(Ge)films.Additionally,a method for enhancing the performance of infrared filters based on rate-modulated deposition of Ge films was proposed.The optical absorption of Ge films in the short-wave infrared(SWIR)and long-wave infrared(LWIR)bands can be effectively reduced by modulating the deposition rate.As the deposition rate increases,the Ge films maintain an amorphous structure.The optical constants of the films in the 1.0-2.5μm and 2.5-13.0μm bands were precisely determined using the Cody-Lorentz model and the classical Lorentz oscillator model,respectively.Notably,high⁃er deposition rates result in a gradual increase in the refractive index.The extinction coefficient increases with the deposition rate in the SWIR region,attributed to the widening of the Urbach tail,while it decreases in the LWIR region due to the reduced absorption caused by the Ge-O stretching mode.Additionally,the films exhibit a tensile stress that decreases with increasing deposition rate.Finally,the effectiveness of the proposed fabrication method for an infrared filter with Ge films deposited at an optimized rate was demonstrated through practical examples.This work provides theoretical and technical support for the application of Ge films in high-performance infrared filters.
文摘The Savitzky-Golay(SG)filter,which employs polynomial least-squares approximations to smooth data and estimate derivatives,is widely used for processing noisy data.However,noise suppression by the SG filter is recognized to be limited at data boundaries and high frequencies,which can significantly reduce the signal-to-noise ratio(SNR).To solve this problem,a novel method synergistically integrating Principal Component Analysis(PCA)with SG filtering is proposed in this paper.This approach avoids the is-sue of excessive smoothing associated with larger window sizes.The proposed PCA-SG filtering algorithm was applied to a CO gas sensing system based on Cavity Ring-Down Spectroscopy(CRDS).The perform-ance of the PCA-SG filtering algorithm is demonstrated through comparison with Moving Average Filtering(MAF),Wavelet Transformation(WT),Kalman Filtering(KF),and the SG filter.The results demonstrate that the proposed algorithm exhibits superior noise reduction capabilities compared to the other algorithms evaluated.The SNR of the ring-down signal was improved from 11.8612 dB to 29.0913 dB,and the stand-ard deviation of the extracted ring-down time constant was reduced from 0.037μs to 0.018μs.These results confirm that the proposed PCA-SG filtering algorithm effectively improves the smoothness of the ring-down curve data,demonstrating its feasibility.
基金supported by the Royal Academy of Engineering,UK,in the scheme of Distinguished International Associate(DIA-2424-5-134).
文摘Accurate estimation of the State of Charge(SOC),State of Health(SOH),and Terminal Resistance(TR)is crucial for the effective operation of Battery Management Systems(BMS)in lithium-ion batteries.This study conducts a comprehensive comparative analysis of four Kalman filter variants Extended Kalman Filter(EKF),Extended Kalman-Bucy Filter(EKBF),Unscented Kalman Filter(UKF),and Unscented Kalman-Bucy Filter(UKBF)under varying battery parameter conditions.These include temperature fluctuation,self-discharge,current direction,cell capacity,process noise,and measurement noise.Our findings reveal significant variations in the performance of SOC and SOH predictions across filters,emphasizing that UKF demonstrates superior robustness to noise,while EKF performs better under accurate system dynamics.The study underscores the need for adaptive filtering strategies that can dynamically adjust to evolving battery parameters,thereby enhancing BMS reliability and extending battery lifespan.
基金supported by the National Natural Science Foundation of China(No.62371263)the Postgraduate Research&Practice Innovation Program of Jiangsu Province(No.SJCK25_1995).
文摘1 Introduction Recently,the increasing demand for advanced telecommunication systems has spurred extensive research into bandpass filters(BPFs),with particular emphasis on miniaturization,reduction of insertion loss(IL),and enhancement of upper stopband rejection(Huang et al.,2021;Snyder et al.,2021;Lin et al.,2023;Zeng et al.,2023).
基金Supported by the Guangxi Special Program for Technological Innovation Guidance(No.GuiKeAC25069006).
文摘In this study,a fifth-degree cubature particle filter(5CPF)is proposed to address the limited estimation accuracy in traditional particle filter algorithms for bearings-only tracking(BOT).This algorithm calculates the recommended density function by introducing a fifth-degree cubature Kalman filter algorithm to guide particle sampling,which effectively alleviates the problem of particle degradation and significantly improves the estimation accuracy of the filter.However,the 5CPF algorithm exhibits high computational complexity,particularly in scenarios with a large number of particles.Therefore,we propose the extended Kalman filter(EKF)-5CPF algorithm,which employs an EKF to replace the time update step for each particle in the 5CPF.This enhances the algorithm’s real-time capability while maintaining the high precision advantage of the 5CPF algorithm.In addition,we construct bearing-only dual-station and single-motion station target tracking systems,and the filtering performances of 5CPF and EKF-5CPF algorithms under different conditions are analyzed.The results show that both the 5CPF algorithm and EKF-5CPF have strong robustness and can adapt to different noise environments.Furthermore,both algorithms significantly outperform traditional nonlinear filtering algorithms in terms of convergence speed,tracking accuracy,and overall stability.
基金supported by the Program of the National Natural Science Foundation of China(22238002)the Fundamental Research Funds for the Central Universities(DUT22-LAB610)Research and Innovation Team Project of Dalian University of Technology(DUT2022TB10).
文摘Color filters are essential components for optical modulation.However,conventional filters are restricted to operating exclusively in either reflective or transmissive mode.Furthermore,they suffer from limited UV and thermal stability,low color purity,and exhibit identical coloration on both surfaces.Herein,we propose a novel design strategy for trans-reflective color filters by integrating the absorptive properties of dye-doped polysulfone(PSU)with the diffractive capabilities of photonic crystals.This composite filter achieved broad-spectrum transmission with deep color outputs—yellow(0.410,0.510),magenta(0.446,0.231),and cyan(0.201,0.425)—closely aligned with standard color space coordinates.By tuning the refractive index of CeO_(2)@SiO_(2)nanoparticles to match dye-based PSU matrix,the transmittance of filters exceeded 70%.Moreover,dye-mediated absorption reduces the scattering light,thereby enhancing reflection color purity(full width at half maxima(FWHM)=25 nm)and producing vibrant blue,green,and red hues.The incorporation of UV-absorbing CeO_(2)@SiO_(2)nanoparticles effectively mitigated dye photodegradation,yielding exceptional UV stability(ΔT<2%under prolonged UV exposure).The filters also exhibited outstanding thermal stability(ΔT<1%after 30 min heat treatment at 230°C).This work establishes a robust materials design framework for multifunctional optical filters,advancing the development of highfidelity dual-mode color systems for next-generation display technologies.
基金funded by the Directorate General of Research and Development,Ministry of Higher Education,Science and Technology of the Republic of Indonesia,with grant number 2.6.63/UN32.14.1/LT/2025.
文摘Recommendation systems are an integral and indispensable part of every digital platform,as they can suggest content or items to users based on their respective needs.Collaborative filtering is a technique often used in various studies,which produces recommendations by analyzing similarities between users and items based on their behavior.Although often used,traditional collaborative filtering techniques still face the main challenge of sparsity.Sparsity problems occur when the data in the system is sparse,meaning that only a portion of users provide feedback on some items,resulting in inaccurate recommendations generated by the system.To overcome this problem,we developed aHybrid Collaborative Filtering model based onMatrix Factorization andGradient Boosting(HCF-MFGB),a new hybrid approach.Our proposed model integrates SVD++,the XGBoost ensemble learning algorithm,and utilizes user demographic data and meta items.We utilize information,both explicitly and implicitly,to learn user preference patterns using SVD++.The XGBoost algorithm is used to create hundreds of decision trees incrementally,thereby improving model accuracy.Meanwhile,user demographic and meta-item data are clustered using the K-Means Clustering algorithm to capture similarities in user and item characteristics.This combination is designed to improve rating prediction accuracy by reducing reliance on minimal explicit rating data,while addressing sparsity issues in movie recommendation systems.The results of experiments on the MovieLens 100K,MovieLens 1M,and CiaoDVD datasets show significant improvements,outperforming various other baselinemodels in terms of RMSE and MAE.On theMovieLens 100K dataset,the HCF-MFGB model obtained an RMSE value of 0.853 and an MAE value of 0.674.On theMovieLens 1M dataset,the HCF-MFGB model obtained an RMSE value of 0.763 and an MAE value of 0.61.On the CiaoDCD dataset,the HCF-MFGB model achieved an RMSE value of 0.718 and an MAE value of 0.495.These results confirm a significant improvement in movie recommendation accuracy with the proposed approach.
文摘This article presents an adaptive intelligent control strategy applied to a lumped-parameter evaporator model,i.e.,a simplified dynamic representation treating the evaporator as a single thermal node with uniform temperature distribution,suitable for control design due to its balance between physical fidelity and computational simplicity.The controller uses a wavelet-based neural proportional,integral,derivative(PID)controller with IIR filtering(infinite impulse response).The dynamic model captures the essential heat and mass transfer phenomena through a nonlinear energy balance,where the cooling capacity“Qevap”is expressed as a non-linear function of the compressor frequency and the temperature difference,specifically,Q_(evap)=k_(1)u(T_(in)−T_(e))with u as compressor frequency,Te evaporator temperature,and Tin inlet fluid temperature.The operating conditions of the system,in general terms,focus on the following variables,the overall thermal capacity is 1000 J/K,typical for small-capacity heat exchangers,The mass flow is 0.05 kg/s,typical for secondary liquid cooling circuits,the overall loss coefficient of 50 W/K that corresponds to small evaporators with partial insulation,the temperatures(inlet)of 10℃and the temperature of environment of 25℃,thermal load of 200 W that corresponds to a small-scaled air conditioning applications.To handle system nonlinearities and improve control performance,aMorlet wavelet-based neural network(Wavenet)is used to dynamically adjust the PID gains online.An IIR filter is incorporated to smooth the adaptive gains,improving stability and reducing oscillations.In contrast to prior wavelet-or neural-adaptive PID controllers in HVAC applications,which typically adjust gains without explicit filtering or not tailored to evaporator dynamics,this work introduces the first PID–Wavenet scheme augmented with an IIR-based stabilization layer,specifically designed to address the combined challenges of nonlinear evaporator behavior,gain oscillation,and real-time implementability.The proposed controller(PID-Wavenet+IIR)is implemented and validated inMATLAB/Simulink,demonstrating superior performance compared to a conventional PID tuned using Simulink’s auto-tuning function.Key results include a reduction in settling time from 13.3 to 8.2 s,a reduction in overshoot from 3.5%to 0.8%,a reduction in steady-state error from 0.12℃ to 0.02℃and a 13%reduction in energy overall consumption.The controller also exhibits greater robustness and adaptability under varying thermal loads.This explicit integration of wavelet-driven adaptation with IIR-filtered gain shaping constitutes the main methodological contribution and novelty of the work.These findings validate the effectiveness of the wavelet-based adaptive approach for advanced thermal management in refrigeration and HVAC systems,with potential applications in controlling variable-speed compressors,liquid chillers,and compact cooling units.
基金supported by the National Natural Science Foundation of China under Grant No.62471366。
文摘This article proposes a generalized strongly coupled resonator quartet(GSCRQ)filter along with its synthesis approach.By introducing out-of-band reflection zeros(RZs),the proposed GSCRQ can generate a transmission zero on each side of the passband without negative couplings.The coupling coefficients in this coupling structure change with the positions of the out-of-band RZs.Thus,the GSCRQ configuration admits flexible design solutions.For GSCRQ coaxial combline filters,all couplings can be implemented as inductive couplings,simplifying the design and manufacturing process.In this article,a 6-2 filter in the GSCRQ configuration is synthesized and designed.The simulated results of the designed filter agree very well with the theoretical characteristics.
基金supported by the National Natural Science Foundation of China(62225303,62403043,62433004)the Beijing Natural Science Foundation(4244085)+1 种基金the Postdoctoral Fellowship Program of China Postdoctoral Science Foundation(GZC20230203)the China Postdoctoral Science Foundation(2023M740201)。
文摘Deep graph contrastive clustering has attracted widespread attentions due to its self-supervised representation learning paradigm and superior clustering performance.Although,two challenges emerge and result in high computational costs.Most existing contrastive methods adopt the data augmentation and then representation learning strategy,where representation learning with trainable graph convolution is coupled with complex and fixed data augmentation,inevitably limiting the efficiency and flexibility.The similarity metric between positive-negative sample pairs is complex and contrastive objective is partial,limiting the discriminability of representation learning.To solve these challenges,a novel wide graph clustering network(WGCN)adhering to representation and then augmentation framework is proposed,which mainly consists of multiorder filter fusion(MFF)and double-level contrastive learning(DCL)modules.Specifically,the MFF module integrates multiorder low-pass filters to extract smooth and multi-scale topological features,utilizing self-attention fusion to reduce redundancy and obtain comprehensive embedding representation.Further,the DCL module constructs two augmented views by the parallel parameter-unshared Siamese encoders rather than complex augmentations on graph.To achieve simple yet effective self-supervised learning,representation self-supervision and structural consistency oriented double-level contrastive loss is designed,where representation self-supervision maximizes the agreement between pairwise augmented embedding representations and structural consistency promotes the mutual information correlation between appending neighborhoods with similar semantics.Extensive experiments on six benchmark datasets demonstrate the superiority of the proposed WGCN,especially highlighting its time-saving characteristic.The code could be available in the https://github.com/Tianxiang Zhao0474/WGCN.
基金supported by the National Science and Technology Major Project of China(No.2011ZX05029-003)CNPC Science Research and Technology Development Project,China(No.2013D-0904)
文摘In this study, we used the multi-resolution graph-based clustering （MRGC） method for determining the electrofacies （EF） and lithofacies （LF） from well log data obtained from the intraplatform bank gas fields located in the Amu Darya Basin. The MRGC could automatically determine the optimal number of clusters without prior knowledge about the structure or cluster numbers of the analyzed data set and allowed the users to control the level of detail actually needed to define the EF. Based on the LF identification and successful EF calibration using core data, an MRGC EF partition model including five clusters and a quantitative LF interpretation chart were constructed. The EF clusters 1 to 5 were interpreted as lagoon, anhydrite flat, interbank, low-energy bank, and high-energy bank, and the coincidence rate in the cored interval could reach 85%. We concluded that the MRGC could be accurately applied to predict the LF in non-cored but logged wells. Therefore, continuous EF clusters were partitioned and corresponding LF were characteristics ＆different LF were analyzed interpreted, and the distribution and petrophysical in the framework of sequence stratigraphy.
文摘A better understanding of the relationship between the structure and functions of urban and suburban spaces is one of the avenues of research still open for geographical information science.The research presented in this paper develops several graph-based metrics whose objective is to characterize some local and global structural properties that reflect the way the overall building layout can be cross-related to the one of the road layout.Such structural properties are modeled as an aggregation of parcels,buildings,and road networks.We introduce several computational measures(Ratio Minimum Distance,Minimum Ratio Minimum Distance,and Metric Compactness)that respectively evaluate the capability for a given road to be connected with the whole road network.These measures reveal emerging sub-network structures and point out differences between less-connective and moreconnective parts of the network.Based on these local and global properties derived from the topological and graph-based representation,and on building density metrics,this paper proposes an analysis of road and building layouts at different levels of granularity.The metrics developed are applied to a case study in which the derived properties reveal coherent as well as incoherent neighborhoods that illustrate the potential of the approach and the way buildings and roads can be relatively connected in a given urban environment.Overall,and by integrating the parcels and buildings layouts,this approach complements other previous and related works that mainly retain the configurational structure of the urban network as well as morphological studies whose focus is generally limited to the analysis of the building layout.
基金the Project Fund for Key Discipline of the Shanghai Municipal Education Commission(No.J50104)the Major State Basic Research Development Program of China(No.2017YFB0403500)。
文摘Simultaneous localization and mapping(SLAM)is widely used in many robot applications to acquire the unknown environment's map and the robots location.Graph-based SLAM is demonstrated to be effective in large-scale scenarios,and it intuitively performs the SLAM as a pose graph.But because of the high data overlap rate,traditional graph-based SLAM is not efficient in some respects,such as real time performance and memory usage.To reduce1 data overlap rate,a graph-based SLAM with distributed submap strategy(DSS)is presented.In its front-end,submap based scan matching is processed and loop closing detection is conducted.Moreover in its back-end,pose graph is updated for global optimization and submap merging.From a series of experiments,it is demonstrated that graph-based SLAM with DSS reduces 51.79%data overlap rate,decreases 39.70%runtime and 24.60%memory usage.The advantages over other low overlap rate method is also proved in runtime,memory usage,accuracy and robustness performance.
文摘The number of botnet malware attacks on Internet devices has grown at an equivalent rate to the number of Internet devices that are connected to the Internet.Bot detection using machine learning(ML)with flow-based features has been extensively studied in the literature.Existing flow-based detection methods involve significant computational overhead that does not completely capture network communication patterns that might reveal other features ofmalicious hosts.Recently,Graph-Based Bot Detection methods using ML have gained attention to overcome these limitations,as graphs provide a real representation of network communications.The purpose of this study is to build a botnet malware detection system utilizing centrality measures for graph-based botnet detection and ML.We propose BotSward,a graph-based bot detection system that is based on ML.We apply the efficient centrality measures,which are Closeness Centrality(CC),Degree Centrality(CC),and PageRank(PR),and compare them with others used in the state-of-the-art.The efficiency of the proposed method is verified on the available Czech Technical University 13 dataset(CTU-13).The CTU-13 dataset contains 13 real botnet traffic scenarios that are connected to a command-and-control(C&C)channel and that cause malicious actions such as phishing,distributed denial-of-service(DDoS)attacks,spam attacks,etc.BotSward is robust to zero-day attacks,suitable for large-scale datasets,and is intended to produce better accuracy than state-of-the-art techniques.The proposed BotSward solution achieved 99%accuracy in botnet attack detection with a false positive rate as low as 0.0001%.
文摘Maximizing network lifetime is measured as the primary issue in Mobile Ad-hoc Networks(MANETs).In geographically routing based models,packet transmission seems to be more appropriate in dense circumstances.The involvement of the Heuristic model directly is not appropriate to offer an effectual solution as it becomes NP-hard issues;therefore investigators concentrate on using Meta-heuristic approaches.Dragonfly Optimization(DFO)is an effective meta-heuristic approach to resolve these problems by providing optimal solutions.Moreover,Meta-heuristic approaches(DFO)turn to be slower in convergence problems and need proper computational time while expanding network size.Thus,DFO is adaptively improved as Adaptive Dragonfly Optimization(ADFO)to fit this model and re-formulated using graph-based m-connection establishment(G-𝑚𝑚CE)to overcome computational time and DFO’s convergence based problems,considerably enhancing DFO performance.In(G-𝑚𝑚CE),Connectivity Zone(CZ)is chosen among source to destination in which optimality should be under those connected regions and ADFO is used for effective route establishment in CZ indeed of complete networking model.To measure complementary features of ADFO and(G-𝑚𝑚CE),hybridization of DFO-(G-𝑚𝑚CE)is anticipated over dense circumstances with reduced energy consumption and delay to enhance network lifetime.The simulation was performed in MATLAB environment.
基金supported by the DOD National Defense Science and Engineering Graduate(NDSEG)Research Fellowshipsupported by the NGA under Contract No.HM04762110003.
文摘Active learning in semi-supervised classification involves introducing additional labels for unlabelled data to improve the accuracy of the underlying classifier.A challenge is to identify which points to label to best improve performance while limiting the number of new labels."Model Change"active learning quantifies the resulting change incurred in the classifier by introducing the additional label(s).We pair this idea with graph-based semi-supervised learning(SSL)methods,that use the spectrum of the graph Laplacian matrix,which can be truncated to avoid prohibitively large computational and storage costs.We consider a family of convex loss functions for which the acquisition function can be efficiently approximated using the Laplace approximation of the posterior distribution.We show a variety of multiclass examples that illustrate improved performance over prior state-of-art.
文摘Many cutting-edge methods are now possible in real-time commercial settings and are growing in popularity on cloud platforms.By incorporating new,cutting-edge technologies to a larger extent without using more infrastructures,the information technology platform is anticipating a completely new level of devel-opment.The following concepts are proposed in this research paper:1)A reliable authentication method Data replication that is optimised;graph-based data encryp-tion and packing colouring in Redundant Array of Independent Disks(RAID)sto-rage.At the data centre,data is encrypted using crypto keys called Key Streams.These keys are produced using the packing colouring method in the web graph’s jump graph.In order to achieve space efficiency,the replication is carried out on optimised many servers employing packing colours.It would be thought that more connections would provide better authentication.This study provides an innovative architecture with robust security,enhanced authentication,and low cost.
基金supported by the National Natural Science Foundation of China under Grant No.62172132.
文摘The surge of large-scale models in recent years has led to breakthroughs in numerous fields,but it has also introduced higher computational costs and more complex network architectures.These increasingly large and intricate networks pose challenges for deployment and execution while also exacerbating the issue of network over-parameterization.To address this issue,various network compression techniques have been developed,such as network pruning.A typical pruning algorithm follows a three-step pipeline involving training,pruning,and retraining.Existing methods often directly set the pruned filters to zero during retraining,significantly reducing the parameter space.However,this direct pruning strategy frequently results in irreversible information loss.In the early stages of training,a network still contains much uncertainty,and evaluating filter importance may not be sufficiently rigorous.To manage the pruning process effectively,this paper proposes a flexible neural network pruning algorithm based on the logistic growth differential equation,considering the characteristics of network training.Unlike other pruning algorithms that directly reduce filter weights,this algorithm introduces a three-stage adaptive weight decay strategy inspired by the logistic growth differential equation.It employs a gentle decay rate in the initial training stage,a rapid decay rate during the intermediate stage,and a slower decay rate in the network convergence stage.Additionally,the decay rate is adjusted adaptively based on the filter weights at each stage.By controlling the adaptive decay rate at each stage,the pruning of neural network filters can be effectively managed.In experiments conducted on the CIFAR-10 and ILSVRC-2012 datasets,the pruning of neural networks significantly reduces the floating-point operations while maintaining the same pruning rate.Specifically,when implementing a 30%pruning rate on the ResNet-110 network,the pruned neural network not only decreases floating-point operations by 40.8%but also enhances the classification accuracy by 0.49%compared to the original network.
