This study proposes a novel time-synchronization protocol inspired by stochastic gradient algorithms.The clock model of each network node in this synchronizer is configured as a generic adaptive filter where different...This study proposes a novel time-synchronization protocol inspired by stochastic gradient algorithms.The clock model of each network node in this synchronizer is configured as a generic adaptive filter where different stochastic gradient algorithms can be adopted for adaptive clock frequency adjustments.The study analyzes the pairwise synchronization behavior of the protocol and proves the generalized convergence of the synchronization error and clock frequency.A novel closed-form expression is also derived for a generalized asymptotic error variance steady state.Steady and convergence analyses are then presented for the synchronization,with frequency adaptations done using least mean square(LMS),the Newton search,the gradient descent(GraDes),the normalized LMS(N-LMS),and the Sign-Data LMS algorithms.Results obtained from real-time experiments showed a better performance of our protocols as compared to the Average Proportional-Integral Synchronization Protocol(AvgPISync)regarding the impact of quantization error on synchronization accuracy,precision,and convergence time.This generalized approach to time synchronization allows flexibility in selecting a suitable protocol for different wireless sensor network applications.展开更多
This paper deals with Mckean-Vlasov backward stochastic differential equations with weak monotonicity coefficients.We first establish the existence and uniqueness of solutions to Mckean-Vlasov backward stochastic diff...This paper deals with Mckean-Vlasov backward stochastic differential equations with weak monotonicity coefficients.We first establish the existence and uniqueness of solutions to Mckean-Vlasov backward stochastic differential equations.Then we obtain a comparison theorem in one-dimensional situation.展开更多
Optimization is the key to obtaining efficient utilization of resources in structural design.Due to the complex nature of truss systems,this study presents a method based on metaheuristic modelling that minimises stru...Optimization is the key to obtaining efficient utilization of resources in structural design.Due to the complex nature of truss systems,this study presents a method based on metaheuristic modelling that minimises structural weight under stress and frequency constraints.Two new algorithms,the Red Kite Optimization Algorithm(ROA)and Secretary Bird Optimization Algorithm(SBOA),are utilized on five benchmark trusses with 10,18,37,72,and 200-bar trusses.Both algorithms are evaluated against benchmarks in the literature.The results indicate that SBOA always reaches a lighter optimal.Designs with reducing structural weight ranging from 0.02%to 0.15%compared to ROA,and up to 6%–8%as compared to conventional algorithms.In addition,SBOA can achieve 15%–20%faster convergence speed and 10%–18%reduction in computational time with a smaller standard deviation over independent runs,which demonstrates its robustness and reliability.It is indicated that the adaptive exploration mechanism of SBOA,especially its Levy flight–based search strategy,can obviously improve optimization performance for low-and high-dimensional trusses.The research has implications in the context of promoting bio-inspired optimization techniques by demonstrating the viability of SBOA,a reliable model for large-scale structural design that provides significant enhancements in performance and convergence behavior.展开更多
In this paper,we propose a new privacy-aware transmission scheduling algorithm for 6G ad hoc networks.This system enables end nodes to select the optimum time and scheme to transmit private data safely.In 6G dynamic h...In this paper,we propose a new privacy-aware transmission scheduling algorithm for 6G ad hoc networks.This system enables end nodes to select the optimum time and scheme to transmit private data safely.In 6G dynamic heterogeneous infrastructures,unstable links and non-uniform hardware capabilities create critical issues regarding security and privacy.Traditional protocols are often too computationally heavy to allow 6G services to achieve their expected Quality-of-Service(QoS).As the transport network is built of ad hoc nodes,there is no guarantee about their trustworthiness or behavior,and transversal functionalities are delegated to the extreme nodes.However,while security can be guaranteed in extreme-to-extreme solutions,privacy cannot,as all intermediate nodes still have to handle the data packets they are transporting.Besides,traditional schemes for private anonymous ad hoc communications are vulnerable against modern intelligent attacks based on learning models.The proposed scheme fulfills this gap.Findings show the probability of a successful intelligent attack reduces by up to 65%compared to ad hoc networks with no privacy protection strategy when used the proposed technology.While congestion probability can remain below 0.001%,as required in 6G services.展开更多
Predator–prey interactions are fundamental to understanding ecosystem stability and biodiversity.In this study,we propose and analyze a stochastic predator–prey model that incorporates two critical ecological factor...Predator–prey interactions are fundamental to understanding ecosystem stability and biodiversity.In this study,we propose and analyze a stochastic predator–prey model that incorporates two critical ecological factors:prey refuge and harvesting.The model also integrates disease transmission within the predator population,adding an important layer of realism.Using rigorous mathematical techniques,we demonstrate the existence and uniqueness of a global positive solution,thereby confirming the model's biological feasibility.We further derive sufficient conditions for two key ecological scenarios:stochastic permanence,which ensures the sustained co-existence of prey and predators over time,and extinction,where one or both populations decline to zero.The interplay between prey refuge and harvesting is thoroughly examined to understand their combined impact on population dynamics.All theoretical results are validated by detailed numerical simulations,highlighting the applicability of the model to real-world ecological systems.From the simulation results,we observed that with an adequate level of prey refuge and predator harvesting,the susceptible predator and prey coexist with extensive oscillations,while the infected predator population was moving towards extinction.In addition,we have investigated the effect of disease transmission on system dynamics.Our results show that,as the transmission rate of disease increases,the susceptible predator approaches extinction,whereas,on the other hand,when it declines,the susceptible predator shows robust oscillations while the infected approaches extinction.In both cases,the prey population demonstrates robust stability due to the prey refuge.Our findings show that the management of harvesting and the prey refuge can be effective ecological tactics for disease control and species protection under stochastic environmental effects.展开更多
Accurate prediction of flood events is important for flood control and risk management.Machine learning techniques contributed greatly to advances in flood predictions,and existing studies mainly focused on predicting...Accurate prediction of flood events is important for flood control and risk management.Machine learning techniques contributed greatly to advances in flood predictions,and existing studies mainly focused on predicting flood resource variables using single or hybrid machine learning techniques.However,class-based flood predictions have rarely been investigated,which can aid in quickly diagnosing comprehensive flood characteristics and proposing targeted management strategies.This study proposed a prediction approach of flood regime metrics and event classes coupling machine learning algorithms with clustering-deduced membership degrees.Five algorithms were adopted for this exploration.Results showed that the class membership degrees accurately determined event classes with class hit rates up to 100%,compared with the four classes clustered from nine regime metrics.The nonlinear algorithms(Multiple Linear Regression,Random Forest,and least squares-Support Vector Machine)outperformed the linear techniques(Multiple Linear Regression and Stepwise Regression)in predicting flood regime metrics.The proposed approach well predicted flood event classes with average class hit rates of 66.0%-85.4%and 47.2%-76.0%in calibration and validation periods,respectively,particularly for the slow and late flood events.The predictive capability of the proposed prediction approach for flood regime metrics and classes was considerably stronger than that of hydrological modeling approach.展开更多
The strong convergence of an explicit full-discrete scheme is investigated for the stochastic Burgers-Huxley equation driven by additive space-time white noise,which possesses both Burgers-type and cubic nonlinearitie...The strong convergence of an explicit full-discrete scheme is investigated for the stochastic Burgers-Huxley equation driven by additive space-time white noise,which possesses both Burgers-type and cubic nonlinearities.To discretize the continuous problem in space,we utilize a spectral Galerkin method.Subsequently,we introduce a nonlinear-tamed exponential integrator scheme,resulting in a fully discrete scheme.Within the framework of semigroup theory,this study provides precise estimations of the Sobolev regularity,L^(∞) regularity in space,and Hölder continuity in time for the mild solution,as well as for its semi-discrete and full-discrete approximations.Building upon these results,we establish moment boundedness for the numerical solution and obtain strong convergence rates in both spatial and temporal dimensions.A numerical example is presented to validate the theoretical findings.展开更多
Addressing the limitations of inadequate stochastic disturbance characterization during wind turbine degradation processes that result in constrained modeling accuracy,replacement-based maintenance practices that devi...Addressing the limitations of inadequate stochastic disturbance characterization during wind turbine degradation processes that result in constrained modeling accuracy,replacement-based maintenance practices that deviate from actual operational conditions,and static maintenance strategies that fail to adapt to accelerated deterioration trends leading to suboptimal remaining useful life utilization,this study proposes a Time-Based Incomplete Maintenance(TBIM)strategy incorporating reliability constraints through stochastic differential equations(SDE).By quantifying stochastic interference via Brownian motion terms and characterizing nonlinear degradation features through state influence rate functions,a high-precision SDE degradation model is constructed,achieving 16%residual reduction compared to conventional ordinary differential equation(ODE)methods.The introduction of age reduction factors and failure rate growth factors establishes an incomplete maintenance mechanism that transcends traditional“as-good-as-new”assumptions,with the TBIM model demonstrating an additional 8.5%residual reduction relative to baseline SDE approaches.A dynamic maintenance interval optimization model driven by dual parameters—preventive maintenance threshold R_(p) and replacement threshold R_(r)—is designed to achieve synergistic optimization of equipment reliability and maintenance economics.Experimental validation demonstrates that the optimized TBIM extends equipment lifespan by 4.4%and reducesmaintenance costs by 4.16%at R_(p)=0.80,while achieving 17.2%lifespan enhancement and 14.6%cost reduction at R_(p)=0.90.This methodology provides a solution for wind turbine preventive maintenance that integrates condition sensitivity with strategic foresight.展开更多
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.展开更多
Optimizing convolutional neural networks(CNNs)for IoT attack detection remains a critical yet challenging task due to the need to balance multiple performance metrics beyond mere accuracy.This study proposes a unified...Optimizing convolutional neural networks(CNNs)for IoT attack detection remains a critical yet challenging task due to the need to balance multiple performance metrics beyond mere accuracy.This study proposes a unified and flexible optimization framework that leverages metaheuristic algorithms to automatically optimize CNN configurations for IoT attack detection.Unlike conventional single-objective approaches,the proposed method formulates a global multi-objective fitness function that integrates accuracy,precision,recall,and model size(speed/model complexity penalty)with adjustable weights.This design enables both single-objective and weightedsum multi-objective optimization,allowing adaptive selection of optimal CNN configurations for diverse deployment requirements.Two representativemetaheuristic algorithms,GeneticAlgorithm(GA)and Particle Swarm Optimization(PSO),are employed to optimize CNNhyperparameters and structure.At each generation/iteration,the best configuration is selected as themost balanced solution across optimization objectives,i.e.,the one achieving themaximum value of the global objective function.Experimental validation on two benchmark datasets,Edge-IIoT and CIC-IoT2023,demonstrates that the proposed GA-and PSO-based models significantly enhance detection accuracy(94.8%–98.3%)and generalization compared with manually tuned CNN configurations,while maintaining compact architectures.The results confirm that the multi-objective framework effectively balances predictive performance and computational efficiency.This work establishes a generalizable and adaptive optimization strategy for deep learning-based IoT attack detection and provides a foundation for future hybrid metaheuristic extensions in broader IoT security applications.展开更多
To establish a parallel fusion approach of processing high dimensional information, the model and criterion of multisensor fuzzy stochastic data fusion were presented. In order to design genetic algorithm fusion, the ...To establish a parallel fusion approach of processing high dimensional information, the model and criterion of multisensor fuzzy stochastic data fusion were presented. In order to design genetic algorithm fusion, the fusion parameter coding, initial population and fitness function establishing, and fuzzy logic controller designing for genetic operations and probability choosing were completed. The discussion on the highly dimensional fusion was given. For a moving target with the division of 1 64 (velocity) and 1 75 (acceleration), the precision of fusion is 0 94 and 0 98 respectively. The fusion approach can improve the reliability and decision precision effectively.展开更多
In this paper, we develop a new theoretical framework by means of the absorbing Markov process theory for analyzing some stochastic global optimization algorithms. Applying the framework to the pure random search, we ...In this paper, we develop a new theoretical framework by means of the absorbing Markov process theory for analyzing some stochastic global optimization algorithms. Applying the framework to the pure random search, we prove that the pure random search converges to the global minimum in probability and its time has geometry distribution. We also analyze the pure adaptive search by this framework and turn out that the pure adaptive search converges to the global minimum in probability and its time has Poisson distribution.展开更多
We propose a surrogate model-assisted algorithm by using a directed fuzzy graph to extract a user’s cognition on evaluated individuals in order to alleviate user fatigue in interactive genetic algorithms with an indi...We propose a surrogate model-assisted algorithm by using a directed fuzzy graph to extract a user’s cognition on evaluated individuals in order to alleviate user fatigue in interactive genetic algorithms with an individual’s fuzzy and stochastic fitness.We firstly present an approach to construct a directed fuzzy graph of an evolutionary population according to individuals’dominance relations,cut-set levels and interval dominance probabilities,and then calculate an individual’s crisp fitness based on the out-degree and in-degree of the fuzzy graph.The approach to obtain training data is achieved using the fuzzy entropy of the evolutionary system to guarantee the credibilities of the samples which are used to train the surrogate model.We adopt a support vector regression machine as the surrogate model and train it using the sampled individuals and their crisp fitness.Then the surrogate model is optimized using the traditional genetic algorithm for some generations,and some good individuals are submitted to the user for the subsequent evolutions so as to guide and accelerate the evolution.Finally,we quantitatively analyze the performance of the presented algorithm in alleviating user fatigue and increasing more opportunities to find the satisfactory individuals,and also apply our algorithm to a fashion evolutionary design system to demonstrate its efficiency.展开更多
Formulizations of mutation and crossover operators independent of representation of solutions are proposed. A kind of precisely quantitative Markov chain of populations of standard genetic algorithms is modeled. It is...Formulizations of mutation and crossover operators independent of representation of solutions are proposed. A kind of precisely quantitative Markov chain of populations of standard genetic algorithms is modeled. It is proved that inadequate parameters of mutation and crossover probabilities degenerate standard genetic algorithm to a class of random search algorithms without selection bias toward any solution based on fitness. After introducing elitist reservation, the stochastic matrix of Markov chain of the best-so-far individual with the highest fitness is derived.The average convergence velocity of genetic algorithms is defined as the mathematical expectation of the mean absorbing time steps that the best-so-far individual transfers from any initial solution to the global optimum. Using the stochastic matrix of the best-so-far individual, a theoretic method and the computing process of estimating the average convergence velocity are proposed.展开更多
Open caissons are widely used in foundation engineering because of their load-bearing efficiency and adaptability in diverse soil conditions.However,accurately predicting their undrained bearing capacity in layered so...Open caissons are widely used in foundation engineering because of their load-bearing efficiency and adaptability in diverse soil conditions.However,accurately predicting their undrained bearing capacity in layered soils remains a complex challenge.This study presents a novel application of five ensemble machine(ML)algorithms-random forest(RF),gradient boosting machine(GBM),extreme gradient boosting(XGBoost),adaptive boosting(AdaBoost),and categorical boosting(CatBoost)-to predict the undrained bearing capacity factor(Nc)of circular open caissons embedded in two-layered clay on the basis of results from finite element limit analysis(FELA).The input dataset consists of 1188 numerical simulations using the Tresca failure criterion,varying in geometrical and soil parameters.The FELA was performed via OptumG2 software with adaptive meshing techniques and verified against existing benchmark studies.The ML models were trained on 70% of the dataset and tested on the remaining 30%.Their performance was evaluated using six statistical metrics:coefficient of determination(R²),mean absolute error(MAE),root mean squared error(RMSE),index of scatter(IOS),RMSE-to-standard deviation ratio(RSR),and variance explained factor(VAF).The results indicate that all the models achieved high accuracy,with R²values exceeding 97.6%and RMSE values below 0.02.Among them,AdaBoost and CatBoost consistently outperformed the other methods across both the training and testing datasets,demonstrating superior generalizability and robustness.The proposed ML framework offers an efficient,accurate,and data-driven alternative to traditional methods for estimating caisson capacity in stratified soils.This approach can aid in reducing computational costs while improving reliability in the early stages of foundation design.展开更多
This paper investigates a multiplayer Pareto game for affine nonlinear stochastic systems disturbed by both external and the internal multiplicative noises.The Pareto cooperative optimal strategies with the H_(∞) con...This paper investigates a multiplayer Pareto game for affine nonlinear stochastic systems disturbed by both external and the internal multiplicative noises.The Pareto cooperative optimal strategies with the H_(∞) constraint are resolved by integrating H_(2)/H_(∞) theory with Pareto game theory.First,a nonlinear stochastic bounded real lemma(SBRL)is derived,explicitly accounting for non-zero initial conditions.Through the analysis of four cross-coupled Hamilton-Jacobi equations(HJEs),we establish necessary and sufficient conditions for the existence of Pareto optimal strategies with the H_(∞) constraint.Secondly,to address the complexity of solving these nonlinear partial differential HJEs,we propose a neural network(NN)framework with synchronous tuning rules for the actor,critic,and disturbance components,based on a reinforcement learning(RL)approach.The designed tuning rules ensure convergence of the actor-critic-disturbance components to the desired values,enabling the realization of robust Pareto control strategies.The convergence of the proposed algorithm is rigorously analyzed using a constructed Lyapunov function for the NN weight errors.Finally,a numerical simulation example is provided to demonstrate the effectiveness of the proposed methods and main results.展开更多
Existing semi-supervisedmedical image segmentation algorithms use copy-paste data augmentation to correct the labeled-unlabeled data distribution mismatch.However,current copy-paste methods have three limitations:(1)t...Existing semi-supervisedmedical image segmentation algorithms use copy-paste data augmentation to correct the labeled-unlabeled data distribution mismatch.However,current copy-paste methods have three limitations:(1)training the model solely with copy-paste mixed pictures from labeled and unlabeled input loses a lot of labeled information;(2)low-quality pseudo-labels can cause confirmation bias in pseudo-supervised learning on unlabeled data;(3)the segmentation performance in low-contrast and local regions is less than optimal.We design a Stochastic Augmentation-Based Dual-Teaching Auxiliary Training Strategy(SADT),which enhances feature diversity and learns high-quality features to overcome these problems.To be more precise,SADT trains the Student Network by using pseudo-label-based training from Teacher Network 1 and supervised learning with labeled data,which prevents the loss of rare labeled data.We introduce a bi-directional copy-pastemask with progressive high-entropy filtering to reduce data distribution disparities and mitigate confirmation bias in pseudo-supervision.For the mixed images,Deep-Shallow Spatial Contrastive Learning(DSSCL)is proposed in the feature spaces of Teacher Network 2 and the Student Network to improve the segmentation capabilities in low-contrast and local areas.In this procedure,the features retrieved by the Student Network are subjected to a random feature perturbation technique.On two openly available datasets,extensive trials show that our proposed SADT performs much better than the state-ofthe-art semi-supervised medical segmentation techniques.Using only 10%of the labeled data for training,SADT was able to acquire a Dice score of 90.10%on the ACDC(Automatic Cardiac Diagnosis Challenge)dataset.展开更多
Quanto options allow the buyer to exchange the foreign currency payoff into the domestic currency at a fixed exchange rate. We investigate quanto options with multiple underlying assets valued in different foreign cur...Quanto options allow the buyer to exchange the foreign currency payoff into the domestic currency at a fixed exchange rate. We investigate quanto options with multiple underlying assets valued in different foreign currencies each with a different strike price in the payoff function. We carry out a comparative performance analysis of different stochastic volatility (SV), stochastic correlation (SC), and stochastic exchange rate (SER) models to determine the best combination of these models for Monte Carlo (MC) simulation pricing. In addition, we test the performance of all model variants with constant correlation as a benchmark. We find that a combination of GARCH-Jump SV, Weibull SC, and Ornstein Uhlenbeck (OU) SER performs best. In addition, we analyze different discretization schemes and their results. In our simulations, the Milstein scheme yields the best balance between execution times and lower standard deviations of price estimates. Furthermore, we find that incorporating mean reversion into stochastic correlation and stochastic FX rate modeling is beneficial for MC simulation pricing. We improve the accuracy of our simulations by implementing antithetic variates variance reduction. Finally, we derive the correlation risk parameters Cora and Gora in our framework so that correlation hedging of quanto options can be performed.展开更多
A stochastic stage-structure predator-prey system with impulsive effect is investigated.First,we build the corresponding system without impulse in order to demonstrate the existence and uniqueness of the global positi...A stochastic stage-structure predator-prey system with impulsive effect is investigated.First,we build the corresponding system without impulse in order to demonstrate the existence and uniqueness of the global positive solution.Second,by selecting an appropriate Lyapunov function,we provide the sufficient condition for the existence of a positive T-periodic solution.Finally,numerical simulations illustrate our theoretical results,which show that the impulse or the white noises can result in the extinction of the predator in a certain condition.展开更多
基金funded by Universiti Putra Malaysia under a Geran Putra Inisiatif(GPI)research grant with reference to GP-GPI/2023/9762100.
文摘This study proposes a novel time-synchronization protocol inspired by stochastic gradient algorithms.The clock model of each network node in this synchronizer is configured as a generic adaptive filter where different stochastic gradient algorithms can be adopted for adaptive clock frequency adjustments.The study analyzes the pairwise synchronization behavior of the protocol and proves the generalized convergence of the synchronization error and clock frequency.A novel closed-form expression is also derived for a generalized asymptotic error variance steady state.Steady and convergence analyses are then presented for the synchronization,with frequency adaptations done using least mean square(LMS),the Newton search,the gradient descent(GraDes),the normalized LMS(N-LMS),and the Sign-Data LMS algorithms.Results obtained from real-time experiments showed a better performance of our protocols as compared to the Average Proportional-Integral Synchronization Protocol(AvgPISync)regarding the impact of quantization error on synchronization accuracy,precision,and convergence time.This generalized approach to time synchronization allows flexibility in selecting a suitable protocol for different wireless sensor network applications.
基金Supported by the National Natural Science Foundation of China(12001074)the Research Innovation Program of Graduate Students in Hunan Province(CX20220258)+1 种基金the Research Innovation Program of Graduate Students of Central South University(1053320214147)the Key Scientific Research Project of Higher Education Institutions in Henan Province(25B110025)。
文摘This paper deals with Mckean-Vlasov backward stochastic differential equations with weak monotonicity coefficients.We first establish the existence and uniqueness of solutions to Mckean-Vlasov backward stochastic differential equations.Then we obtain a comparison theorem in one-dimensional situation.
文摘Optimization is the key to obtaining efficient utilization of resources in structural design.Due to the complex nature of truss systems,this study presents a method based on metaheuristic modelling that minimises structural weight under stress and frequency constraints.Two new algorithms,the Red Kite Optimization Algorithm(ROA)and Secretary Bird Optimization Algorithm(SBOA),are utilized on five benchmark trusses with 10,18,37,72,and 200-bar trusses.Both algorithms are evaluated against benchmarks in the literature.The results indicate that SBOA always reaches a lighter optimal.Designs with reducing structural weight ranging from 0.02%to 0.15%compared to ROA,and up to 6%–8%as compared to conventional algorithms.In addition,SBOA can achieve 15%–20%faster convergence speed and 10%–18%reduction in computational time with a smaller standard deviation over independent runs,which demonstrates its robustness and reliability.It is indicated that the adaptive exploration mechanism of SBOA,especially its Levy flight–based search strategy,can obviously improve optimization performance for low-and high-dimensional trusses.The research has implications in the context of promoting bio-inspired optimization techniques by demonstrating the viability of SBOA,a reliable model for large-scale structural design that provides significant enhancements in performance and convergence behavior.
基金funding from the European Commission by the Ruralities project(grant agreement no.101060876).
文摘In this paper,we propose a new privacy-aware transmission scheduling algorithm for 6G ad hoc networks.This system enables end nodes to select the optimum time and scheme to transmit private data safely.In 6G dynamic heterogeneous infrastructures,unstable links and non-uniform hardware capabilities create critical issues regarding security and privacy.Traditional protocols are often too computationally heavy to allow 6G services to achieve their expected Quality-of-Service(QoS).As the transport network is built of ad hoc nodes,there is no guarantee about their trustworthiness or behavior,and transversal functionalities are delegated to the extreme nodes.However,while security can be guaranteed in extreme-to-extreme solutions,privacy cannot,as all intermediate nodes still have to handle the data packets they are transporting.Besides,traditional schemes for private anonymous ad hoc communications are vulnerable against modern intelligent attacks based on learning models.The proposed scheme fulfills this gap.Findings show the probability of a successful intelligent attack reduces by up to 65%compared to ad hoc networks with no privacy protection strategy when used the proposed technology.While congestion probability can remain below 0.001%,as required in 6G services.
基金supported by the National Natural Science Foundation of China(Grant No.32271554)the Guangdong Basic and Applied Basic Research Foundation(Grant No.2023A1515011501)。
文摘Predator–prey interactions are fundamental to understanding ecosystem stability and biodiversity.In this study,we propose and analyze a stochastic predator–prey model that incorporates two critical ecological factors:prey refuge and harvesting.The model also integrates disease transmission within the predator population,adding an important layer of realism.Using rigorous mathematical techniques,we demonstrate the existence and uniqueness of a global positive solution,thereby confirming the model's biological feasibility.We further derive sufficient conditions for two key ecological scenarios:stochastic permanence,which ensures the sustained co-existence of prey and predators over time,and extinction,where one or both populations decline to zero.The interplay between prey refuge and harvesting is thoroughly examined to understand their combined impact on population dynamics.All theoretical results are validated by detailed numerical simulations,highlighting the applicability of the model to real-world ecological systems.From the simulation results,we observed that with an adequate level of prey refuge and predator harvesting,the susceptible predator and prey coexist with extensive oscillations,while the infected predator population was moving towards extinction.In addition,we have investigated the effect of disease transmission on system dynamics.Our results show that,as the transmission rate of disease increases,the susceptible predator approaches extinction,whereas,on the other hand,when it declines,the susceptible predator shows robust oscillations while the infected approaches extinction.In both cases,the prey population demonstrates robust stability due to the prey refuge.Our findings show that the management of harvesting and the prey refuge can be effective ecological tactics for disease control and species protection under stochastic environmental effects.
基金National Key Research and Development Program of China,No.2023YFC3006704National Natural Science Foundation of China,No.42171047CAS-CSIRO Partnership Joint Project of 2024,No.177GJHZ2023097MI。
文摘Accurate prediction of flood events is important for flood control and risk management.Machine learning techniques contributed greatly to advances in flood predictions,and existing studies mainly focused on predicting flood resource variables using single or hybrid machine learning techniques.However,class-based flood predictions have rarely been investigated,which can aid in quickly diagnosing comprehensive flood characteristics and proposing targeted management strategies.This study proposed a prediction approach of flood regime metrics and event classes coupling machine learning algorithms with clustering-deduced membership degrees.Five algorithms were adopted for this exploration.Results showed that the class membership degrees accurately determined event classes with class hit rates up to 100%,compared with the four classes clustered from nine regime metrics.The nonlinear algorithms(Multiple Linear Regression,Random Forest,and least squares-Support Vector Machine)outperformed the linear techniques(Multiple Linear Regression and Stepwise Regression)in predicting flood regime metrics.The proposed approach well predicted flood event classes with average class hit rates of 66.0%-85.4%and 47.2%-76.0%in calibration and validation periods,respectively,particularly for the slow and late flood events.The predictive capability of the proposed prediction approach for flood regime metrics and classes was considerably stronger than that of hydrological modeling approach.
基金partially supported by the National Natural Science Foundation of China(Grant No.12071073)financial support by the Jiangsu Provincial Scientific Research Center of Applied Mathematics(Grant No.BK20233002).
文摘The strong convergence of an explicit full-discrete scheme is investigated for the stochastic Burgers-Huxley equation driven by additive space-time white noise,which possesses both Burgers-type and cubic nonlinearities.To discretize the continuous problem in space,we utilize a spectral Galerkin method.Subsequently,we introduce a nonlinear-tamed exponential integrator scheme,resulting in a fully discrete scheme.Within the framework of semigroup theory,this study provides precise estimations of the Sobolev regularity,L^(∞) regularity in space,and Hölder continuity in time for the mild solution,as well as for its semi-discrete and full-discrete approximations.Building upon these results,we establish moment boundedness for the numerical solution and obtain strong convergence rates in both spatial and temporal dimensions.A numerical example is presented to validate the theoretical findings.
基金supported in part by the National Natural Science Foundation of China(No.52467008)Gansu Provincial Depatment of Education Youth Doctoral Suppo Project(2024QB-051).
文摘Addressing the limitations of inadequate stochastic disturbance characterization during wind turbine degradation processes that result in constrained modeling accuracy,replacement-based maintenance practices that deviate from actual operational conditions,and static maintenance strategies that fail to adapt to accelerated deterioration trends leading to suboptimal remaining useful life utilization,this study proposes a Time-Based Incomplete Maintenance(TBIM)strategy incorporating reliability constraints through stochastic differential equations(SDE).By quantifying stochastic interference via Brownian motion terms and characterizing nonlinear degradation features through state influence rate functions,a high-precision SDE degradation model is constructed,achieving 16%residual reduction compared to conventional ordinary differential equation(ODE)methods.The introduction of age reduction factors and failure rate growth factors establishes an incomplete maintenance mechanism that transcends traditional“as-good-as-new”assumptions,with the TBIM model demonstrating an additional 8.5%residual reduction relative to baseline SDE approaches.A dynamic maintenance interval optimization model driven by dual parameters—preventive maintenance threshold R_(p) and replacement threshold R_(r)—is designed to achieve synergistic optimization of equipment reliability and maintenance economics.Experimental validation demonstrates that the optimized TBIM extends equipment lifespan by 4.4%and reducesmaintenance costs by 4.16%at R_(p)=0.80,while achieving 17.2%lifespan enhancement and 14.6%cost reduction at R_(p)=0.90.This methodology provides a solution for wind turbine preventive maintenance that integrates condition sensitivity with strategic foresight.
基金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.
文摘Optimizing convolutional neural networks(CNNs)for IoT attack detection remains a critical yet challenging task due to the need to balance multiple performance metrics beyond mere accuracy.This study proposes a unified and flexible optimization framework that leverages metaheuristic algorithms to automatically optimize CNN configurations for IoT attack detection.Unlike conventional single-objective approaches,the proposed method formulates a global multi-objective fitness function that integrates accuracy,precision,recall,and model size(speed/model complexity penalty)with adjustable weights.This design enables both single-objective and weightedsum multi-objective optimization,allowing adaptive selection of optimal CNN configurations for diverse deployment requirements.Two representativemetaheuristic algorithms,GeneticAlgorithm(GA)and Particle Swarm Optimization(PSO),are employed to optimize CNNhyperparameters and structure.At each generation/iteration,the best configuration is selected as themost balanced solution across optimization objectives,i.e.,the one achieving themaximum value of the global objective function.Experimental validation on two benchmark datasets,Edge-IIoT and CIC-IoT2023,demonstrates that the proposed GA-and PSO-based models significantly enhance detection accuracy(94.8%–98.3%)and generalization compared with manually tuned CNN configurations,while maintaining compact architectures.The results confirm that the multi-objective framework effectively balances predictive performance and computational efficiency.This work establishes a generalizable and adaptive optimization strategy for deep learning-based IoT attack detection and provides a foundation for future hybrid metaheuristic extensions in broader IoT security applications.
文摘To establish a parallel fusion approach of processing high dimensional information, the model and criterion of multisensor fuzzy stochastic data fusion were presented. In order to design genetic algorithm fusion, the fusion parameter coding, initial population and fitness function establishing, and fuzzy logic controller designing for genetic operations and probability choosing were completed. The discussion on the highly dimensional fusion was given. For a moving target with the division of 1 64 (velocity) and 1 75 (acceleration), the precision of fusion is 0 94 and 0 98 respectively. The fusion approach can improve the reliability and decision precision effectively.
文摘In this paper, we develop a new theoretical framework by means of the absorbing Markov process theory for analyzing some stochastic global optimization algorithms. Applying the framework to the pure random search, we prove that the pure random search converges to the global minimum in probability and its time has geometry distribution. We also analyze the pure adaptive search by this framework and turn out that the pure adaptive search converges to the global minimum in probability and its time has Poisson distribution.
基金supported by National Natural Science Foundation of China(No.60775044)the Program for New Century Excellent Talentsin University(No.NCET-07-0802)
文摘We propose a surrogate model-assisted algorithm by using a directed fuzzy graph to extract a user’s cognition on evaluated individuals in order to alleviate user fatigue in interactive genetic algorithms with an individual’s fuzzy and stochastic fitness.We firstly present an approach to construct a directed fuzzy graph of an evolutionary population according to individuals’dominance relations,cut-set levels and interval dominance probabilities,and then calculate an individual’s crisp fitness based on the out-degree and in-degree of the fuzzy graph.The approach to obtain training data is achieved using the fuzzy entropy of the evolutionary system to guarantee the credibilities of the samples which are used to train the surrogate model.We adopt a support vector regression machine as the surrogate model and train it using the sampled individuals and their crisp fitness.Then the surrogate model is optimized using the traditional genetic algorithm for some generations,and some good individuals are submitted to the user for the subsequent evolutions so as to guide and accelerate the evolution.Finally,we quantitatively analyze the performance of the presented algorithm in alleviating user fatigue and increasing more opportunities to find the satisfactory individuals,and also apply our algorithm to a fashion evolutionary design system to demonstrate its efficiency.
文摘Formulizations of mutation and crossover operators independent of representation of solutions are proposed. A kind of precisely quantitative Markov chain of populations of standard genetic algorithms is modeled. It is proved that inadequate parameters of mutation and crossover probabilities degenerate standard genetic algorithm to a class of random search algorithms without selection bias toward any solution based on fitness. After introducing elitist reservation, the stochastic matrix of Markov chain of the best-so-far individual with the highest fitness is derived.The average convergence velocity of genetic algorithms is defined as the mathematical expectation of the mean absorbing time steps that the best-so-far individual transfers from any initial solution to the global optimum. Using the stochastic matrix of the best-so-far individual, a theoretic method and the computing process of estimating the average convergence velocity are proposed.
文摘Open caissons are widely used in foundation engineering because of their load-bearing efficiency and adaptability in diverse soil conditions.However,accurately predicting their undrained bearing capacity in layered soils remains a complex challenge.This study presents a novel application of five ensemble machine(ML)algorithms-random forest(RF),gradient boosting machine(GBM),extreme gradient boosting(XGBoost),adaptive boosting(AdaBoost),and categorical boosting(CatBoost)-to predict the undrained bearing capacity factor(Nc)of circular open caissons embedded in two-layered clay on the basis of results from finite element limit analysis(FELA).The input dataset consists of 1188 numerical simulations using the Tresca failure criterion,varying in geometrical and soil parameters.The FELA was performed via OptumG2 software with adaptive meshing techniques and verified against existing benchmark studies.The ML models were trained on 70% of the dataset and tested on the remaining 30%.Their performance was evaluated using six statistical metrics:coefficient of determination(R²),mean absolute error(MAE),root mean squared error(RMSE),index of scatter(IOS),RMSE-to-standard deviation ratio(RSR),and variance explained factor(VAF).The results indicate that all the models achieved high accuracy,with R²values exceeding 97.6%and RMSE values below 0.02.Among them,AdaBoost and CatBoost consistently outperformed the other methods across both the training and testing datasets,demonstrating superior generalizability and robustness.The proposed ML framework offers an efficient,accurate,and data-driven alternative to traditional methods for estimating caisson capacity in stratified soils.This approach can aid in reducing computational costs while improving reliability in the early stages of foundation design.
基金supported by the National Natural Science Foundation of China(12426609,62203220,62373229)the Taishan Scholar Project Foundation of Shandong Province(tsqnz20230619,tsqn202408110)+2 种基金the Fundamental Research Foundation of the Central Universities(23Cx06024A)the Natural Science Foundation of Shandong Province(ZR2024QF096)the Outstanding Youth Innovation Team in Shandong Higher Education Institutions(2023KJ061).
文摘This paper investigates a multiplayer Pareto game for affine nonlinear stochastic systems disturbed by both external and the internal multiplicative noises.The Pareto cooperative optimal strategies with the H_(∞) constraint are resolved by integrating H_(2)/H_(∞) theory with Pareto game theory.First,a nonlinear stochastic bounded real lemma(SBRL)is derived,explicitly accounting for non-zero initial conditions.Through the analysis of four cross-coupled Hamilton-Jacobi equations(HJEs),we establish necessary and sufficient conditions for the existence of Pareto optimal strategies with the H_(∞) constraint.Secondly,to address the complexity of solving these nonlinear partial differential HJEs,we propose a neural network(NN)framework with synchronous tuning rules for the actor,critic,and disturbance components,based on a reinforcement learning(RL)approach.The designed tuning rules ensure convergence of the actor-critic-disturbance components to the desired values,enabling the realization of robust Pareto control strategies.The convergence of the proposed algorithm is rigorously analyzed using a constructed Lyapunov function for the NN weight errors.Finally,a numerical simulation example is provided to demonstrate the effectiveness of the proposed methods and main results.
基金supported by the Natural Science Foundation of China(No.41804112,author:Chengyun Song).
文摘Existing semi-supervisedmedical image segmentation algorithms use copy-paste data augmentation to correct the labeled-unlabeled data distribution mismatch.However,current copy-paste methods have three limitations:(1)training the model solely with copy-paste mixed pictures from labeled and unlabeled input loses a lot of labeled information;(2)low-quality pseudo-labels can cause confirmation bias in pseudo-supervised learning on unlabeled data;(3)the segmentation performance in low-contrast and local regions is less than optimal.We design a Stochastic Augmentation-Based Dual-Teaching Auxiliary Training Strategy(SADT),which enhances feature diversity and learns high-quality features to overcome these problems.To be more precise,SADT trains the Student Network by using pseudo-label-based training from Teacher Network 1 and supervised learning with labeled data,which prevents the loss of rare labeled data.We introduce a bi-directional copy-pastemask with progressive high-entropy filtering to reduce data distribution disparities and mitigate confirmation bias in pseudo-supervision.For the mixed images,Deep-Shallow Spatial Contrastive Learning(DSSCL)is proposed in the feature spaces of Teacher Network 2 and the Student Network to improve the segmentation capabilities in low-contrast and local areas.In this procedure,the features retrieved by the Student Network are subjected to a random feature perturbation technique.On two openly available datasets,extensive trials show that our proposed SADT performs much better than the state-ofthe-art semi-supervised medical segmentation techniques.Using only 10%of the labeled data for training,SADT was able to acquire a Dice score of 90.10%on the ACDC(Automatic Cardiac Diagnosis Challenge)dataset.
文摘Quanto options allow the buyer to exchange the foreign currency payoff into the domestic currency at a fixed exchange rate. We investigate quanto options with multiple underlying assets valued in different foreign currencies each with a different strike price in the payoff function. We carry out a comparative performance analysis of different stochastic volatility (SV), stochastic correlation (SC), and stochastic exchange rate (SER) models to determine the best combination of these models for Monte Carlo (MC) simulation pricing. In addition, we test the performance of all model variants with constant correlation as a benchmark. We find that a combination of GARCH-Jump SV, Weibull SC, and Ornstein Uhlenbeck (OU) SER performs best. In addition, we analyze different discretization schemes and their results. In our simulations, the Milstein scheme yields the best balance between execution times and lower standard deviations of price estimates. Furthermore, we find that incorporating mean reversion into stochastic correlation and stochastic FX rate modeling is beneficial for MC simulation pricing. We improve the accuracy of our simulations by implementing antithetic variates variance reduction. Finally, we derive the correlation risk parameters Cora and Gora in our framework so that correlation hedging of quanto options can be performed.
基金Supported by NSFC(Nos.10671182,12061020)NSF of Guizhou Province(Nos.QKH[2019]1123,QKHKY[2021]088,QKHKY[2022]301,QKH-ZK[2021]331)the Ph.D.Project of Guizhou Education University(No.2021BS005)。
文摘A stochastic stage-structure predator-prey system with impulsive effect is investigated.First,we build the corresponding system without impulse in order to demonstrate the existence and uniqueness of the global positive solution.Second,by selecting an appropriate Lyapunov function,we provide the sufficient condition for the existence of a positive T-periodic solution.Finally,numerical simulations illustrate our theoretical results,which show that the impulse or the white noises can result in the extinction of the predator in a certain condition.
