This study examines the mediating role of positive psychological capital and the moderating role of ethnicity in the relationship between mindfulness and internalizing/externalizing problems among adolescents.The stud...This study examines the mediating role of positive psychological capital and the moderating role of ethnicity in the relationship between mindfulness and internalizing/externalizing problems among adolescents.The study sample comprized Chinese adolescents(N=637 ethnic minority;females=40.97%,meam age=12.68,SD=0.49 years;N=636 Han;females=49.06%,mean age=12.71,SD=0.47 years).The participants completed the Child and Adolescent Mindfulness Measure,the Positive Psycap Questionnaire,and the Youth Self-Report.Results from the moderated mediation analysis showed mindfulness was negatively associated with both internalizing and externalizing problems.Ethnicity moderated the relationship between mindfulness and internalizing problems to be stronger for Han adolescents compared to ethnic minority adolescents.Psychological capital mediated the relationship between mindfulness and internalizing problems in both groups,with a negative direction.Findings support the Conservation of Resources theory and highlight mindfulness as a personal resource fostering adolescent well-being in multicultural contexts.展开更多
With the development of technology,diffusion model-based solvers have shown significant promise in solving Combinatorial Optimization(CO)problems,particularly in tackling Non-deterministic Polynomial-time hard(NP-hard...With the development of technology,diffusion model-based solvers have shown significant promise in solving Combinatorial Optimization(CO)problems,particularly in tackling Non-deterministic Polynomial-time hard(NP-hard)problems such as the Traveling Salesman Problem(TSP).However,existing diffusion model-based solvers typically employ a fixed,uniform noise schedule(e.g.,linear or cosine annealing)across all training instances,failing to fully account for the unique characteristics of each problem instance.To address this challenge,we present GraphGuided Diffusion Solvers(GGDS),an enhanced method for improving graph-based diffusion models.GGDS leverages Graph Neural Networks(GNNs)to capture graph structural information embedded in node coordinates and adjacency matrices,dynamically adjusting the noise levels in the diffusion model.This study investigates the TSP by examining two distinct time-step noise generation strategies:cosine annealing and a Neural Network(NN)-based approach.We evaluate their performance across different problem scales,particularly after integrating graph structural information.Experimental results indicate that GGDS outperforms previous methods with average performance improvements of 18.7%,6.3%,and 88.7%on TSP-500,TSP-100,and TSP-50,respectively.Specifically,GGDS demonstrates superior performance on TSP-500 and TSP-50,while its performance on TSP-100 is either comparable to or slightly better than that of previous methods,depending on the chosen noise schedule and decoding strategy.展开更多
Generalised reduced masses with a set of equations governing the three relative motions between two of 3-bodies in their gravitational field are established,of which the dynamic characteristics of 3-body dynamics,fund...Generalised reduced masses with a set of equations governing the three relative motions between two of 3-bodies in their gravitational field are established,of which the dynamic characteristics of 3-body dynamics,fundamental bases of this paper,are revealed.Based on these findings,an equivalent system is developed,which is a 2-body system with its total mass,constant angular momentum,kinetic and potential energies same as the total ones of three relative motions,so that it can be solved using the well-known theory of the 2-body system.From the solution of an equivalent system with the revealed characteristics of three relative motions,the general theoretical solutions of the 3-body system are obtained in the curve-integration forms along the orbits in the imaged radial motion space.The possible periodical orbits with generalised Kepler’s law are presented.Following the description and mathematical demonstrations of the proposed methods,the examples including Euler’s/Lagrange’s problems,and a reported numerical one are solved to validate the proposed methods.The methods derived from the 3-body system are extended to N-body problems.展开更多
Defining science and demarcating it from pseudoscience are longstanding core issues in the philosophy of science.Hilbert’s traditional axiomatic standards(consistency,completeness,independence)struggle with modern co...Defining science and demarcating it from pseudoscience are longstanding core issues in the philosophy of science.Hilbert’s traditional axiomatic standards(consistency,completeness,independence)struggle with modern complex systems,while existing demarcation criteria like replicability and Popper’s falsificationism have practical limitations.Analyzing incompatibilities in complex systems,this paper proposes a revised framework:modified Hilbert axiomatic standards(clearly defined concepts,logical consistency,unrefuted axioms)and dynamic demarcation criteria.Abandoning unattainable traditional requirements of completeness and independence,it emphasizes conceptual clarity,openness,and progressiveness,offering an operational,self-consistent basis for judging scientificity.展开更多
The proliferation of carrier aircraft and the integration of unmanned aerial vehicles(UAVs)on aircraft carriers present new challenges to the automation of launch and recovery operations.This paper investigates a coll...The proliferation of carrier aircraft and the integration of unmanned aerial vehicles(UAVs)on aircraft carriers present new challenges to the automation of launch and recovery operations.This paper investigates a collaborative scheduling problem inherent to the operational processes of carrier aircraft,where launch and recovery tasks are conducted concurrently on the flight deck.The objective is to minimize the cumulative weighted waiting time in the air for recovering aircraft and the cumulative weighted delay time for launching aircraft.To tackle this challenge,a multiple population self-adaptive differential evolution(MPSADE)algorithm is proposed.This method features a self-adaptive parameter updating mechanism that is contingent upon population diversity,an asynchronous updating scheme,an individual migration operator,and a global crossover mechanism.Additionally,comprehensive experiments are conducted to validate the effectiveness of the proposed model and algorithm.Ultimately,a comparative analysis with existing operation modes confirms the enhanced efficiency of the collaborative operation mode.展开更多
Circumlunar abort trajectories constitute a vital contingency return strategy during the translunar phase of crewed lunar missions.This paper proposes a methodology for constructing the solution set of the circumlunar...Circumlunar abort trajectories constitute a vital contingency return strategy during the translunar phase of crewed lunar missions.This paper proposes a methodology for constructing the solution set of the circumlunar abort trajectory and leverages its advantageous properties to address the optimization design problem of abort trajectories.Initially,a solution set of all feasible abort trajectories,originating from an abort point on the nominal trajectory and complying with fundamental reentry constraints,is formulated through the introduction of two novel design parameters.Subsequently,the geometric characteristics of the solution set,as well as the distributional properties of key iterative constraint responses,including flight time and velocity increment,are analyzed.Finally,the characteristics exhibited in the solution set are employed to directly identify the design parameters of the abort trajectories with minimum flight time and velocity increment,thereby providing solutions to two distinct types of optimization problems.The simulation results for a variety of nominal trajectories,encompassing the reconstruction and redesign of the Apollo13 abort trajectory,validate the proposed method,demonstrating its ability to directly generate optimal abort trajectories.The method proposed in this paper investigates feasible abort trajectories from a global perspective,providing both a framework and convenience for mission planning and iterative optimization in abort trajectory design.展开更多
During the use of robotics in applications such as antiterrorism or combat,a motion-constrained pursuer vehicle,such as a Dubins unmanned surface vehicle(USV),must get close enough(within a prescribed zero or positive...During the use of robotics in applications such as antiterrorism or combat,a motion-constrained pursuer vehicle,such as a Dubins unmanned surface vehicle(USV),must get close enough(within a prescribed zero or positive distance)to a moving target as quickly as possible,resulting in the extended minimum-time intercept problem(EMTIP).Existing research has primarily focused on the zero-distance intercept problem,MTIP,establishing the necessary or sufficient conditions for MTIP optimality,and utilizing analytic algorithms,such as root-finding algorithms,to calculate the optimal solutions.However,these approaches depend heavily on the properties of the analytic algorithm,making them inapplicable when problem settings change,such as in the case of a positive effective range or complicated target motions outside uniform rectilinear motion.In this study,an approach employing a high-accuracy and quality-guaranteed mixed-integer piecewise-linear program(QG-PWL)is proposed for the EMTIP.This program can accommodate different effective interception ranges and complicated target motions(variable velocity or complicated trajectories).The high accuracy and quality guarantees of QG-PWL originate from elegant strategies such as piecewise linearization and other developed operation strategies.The approximate error in the intercept path length is proved to be bounded to h^(2)/(4√2),where h is the piecewise length.展开更多
Owing to their global search capabilities and gradient-free operation,metaheuristic algorithms are widely applied to a wide range of optimization problems.However,their computational demands become prohibitive when ta...Owing to their global search capabilities and gradient-free operation,metaheuristic algorithms are widely applied to a wide range of optimization problems.However,their computational demands become prohibitive when tackling high-dimensional optimization challenges.To effectively address these challenges,this study introduces cooperative metaheuristics integrating dynamic dimension reduction(DR).Building upon particle swarm optimization(PSO)and differential evolution(DE),the proposed cooperative methods C-PSO and C-DE are developed.In the proposed methods,the modified principal components analysis(PCA)is utilized to reduce the dimension of design variables,thereby decreasing computational costs.The dynamic DR strategy implements periodic execution of modified PCA after a fixed number of iterations,resulting in the important dimensions being dynamically identified.Compared with the static one,the dynamic DR strategy can achieve precise identification of important dimensions,thereby enabling accelerated convergence toward optimal solutions.Furthermore,the influence of cumulative contribution rate thresholds on optimization problems with different dimensions is investigated.Metaheuristic algorithms(PSO,DE)and cooperative metaheuristics(C-PSO,C-DE)are examined by 15 benchmark functions and two engineering design problems(speed reducer and composite pressure vessel).Comparative results demonstrate that the cooperative methods achieve significantly superior performance compared to standard methods in both solution accuracy and computational efficiency.Compared to standard metaheuristic algorithms,cooperative metaheuristics achieve a reduction in computational cost of at least 40%.The cooperative metaheuristics can be effectively used to tackle both high-dimensional unconstrained and constrained optimization problems.展开更多
With the increasing severity of network security threats,Network Intrusion Detection(NID)has become a key technology to ensure network security.To address the problem of low detection rate of traditional intrusion det...With the increasing severity of network security threats,Network Intrusion Detection(NID)has become a key technology to ensure network security.To address the problem of low detection rate of traditional intrusion detection models,this paper proposes a Dual-Attention model for NID,which combines Convolutional Neural Network(CNN)and Bidirectional Long Short-Term Memory(BiLSTM)to design two modules:the FocusConV and the TempoNet module.The FocusConV module,which automatically adjusts and weights CNN extracted local features,focuses on local features that are more important for intrusion detection.The TempoNet module focuses on global information,identifies more important features in time steps or sequences,and filters and weights the information globally to further improve the accuracy and robustness of NID.Meanwhile,in order to solve the class imbalance problem in the dataset,the EQL v2 method is used to compute the class weights of each class and to use them in the loss computation,which optimizes the performance of the model on the class imbalance problem.Extensive experiments were conducted on the NSL-KDD,UNSW-NB15,and CIC-DDos2019 datasets,achieving average accuracy rates of 99.66%,87.47%,and 99.39%,respectively,demonstrating excellent detection accuracy and robustness.The model also improves the detection performance of minority classes in the datasets.On the UNSW-NB15 dataset,the detection rates for Analysis,Exploits,and Shellcode attacks increased by 7%,7%,and 10%,respectively,demonstrating the Dual-Attention CNN-BiLSTM model’s excellent performance in NID.展开更多
We incorporate a non-Markovian feedback mechanism into the simulated bifurcation method for dynamical solvers addressing combinatorial optimization problems.By reinjecting a portion of dissipated kinetic energy into e...We incorporate a non-Markovian feedback mechanism into the simulated bifurcation method for dynamical solvers addressing combinatorial optimization problems.By reinjecting a portion of dissipated kinetic energy into each spin in a history-dependent and trajectory-informed manner,the method effectively suppresses early freezing induced by inelastic boundaries and enhances the system's ability to explore complex energy landscapes.Numerical results on the maximum cut(MAX-CUT)instances of fully connected Sherrington–Kirkpatrick(SK)spin glass models,including the 2000-spin K_(2000)benchmark,demonstrate that the non-Markovian algorithm significantly improves both solution quality and convergence speed.Tests on randomly generated SK instances with 100 to 1000 spins further indicate favorable scalability and substantial gains in computational efficiency.Moreover,the proposed scheme is well suited for massively parallel hardware implementations,such as field-programmable gate arrays,providing a practical and scalable approach for solving large-scale combinatorial optimization problems.展开更多
Small angle x-ray scattering(SAXS)is an advanced technique for characterizing the particle size distribution(PSD)of nanoparticles.However,the ill-posed nature of inverse problems in SAXS data analysis often reduces th...Small angle x-ray scattering(SAXS)is an advanced technique for characterizing the particle size distribution(PSD)of nanoparticles.However,the ill-posed nature of inverse problems in SAXS data analysis often reduces the accuracy of conventional methods.This article proposes a user-friendly software for PSD analysis,GranuSAS,which employs an algorithm that integrates truncated singular value decomposition(TSVD)with the Chahine method.This approach employs TSVD for data preprocessing,generating a set of initial solutions with noise suppression.A high-quality initial solution is subsequently selected via the L-curve method.This selected candidate solution is then iteratively refined by the Chahine algorithm,enforcing constraints such as non-negativity and improving physical interpretability.Most importantly,GranuSAS employs a parallel architecture that simultaneously yields inversion results from multiple shape models and,by evaluating the accuracy of each model's reconstructed scattering curve,offers a suggestion for model selection in material systems.To systematically validate the accuracy and efficiency of the software,verification was performed using both simulated and experimental datasets.The results demonstrate that the proposed software delivers both satisfactory accuracy and reliable computational efficiency.It provides an easy-to-use and reliable tool for researchers in materials science,helping them fully exploit the potential of SAXS in nanoparticle characterization.展开更多
There is a contradiction between the evolution rate of materials and the time resolution of SR-CT characterization in the in situ synchrotron radiation computed tomography(SR-CT)characterization of ultrafast evolution...There is a contradiction between the evolution rate of materials and the time resolution of SR-CT characterization in the in situ synchrotron radiation computed tomography(SR-CT)characterization of ultrafast evolution process.The sampling strategy of the ultra-sparse angle is an effective method for improving time resolution.Accurate reconstruction under sparse sampling conditions has always been a bottleneck problem.In recent years,convolutional neural networks have shown outstanding advantages in sparse-angle CT reconstruction given the development of deep learning.However,existing ideas did not consider the expression of high-frequency details in neural networks,limiting their application in accurate SR-CT characterization.A novel high-frequency information-constrained deep learning network(HFIC-Net)is proposed in response to this problem.Additional high-frequency information constraints are added to improve the accuracy of the reconstruction results.Further,a series of numerical reconstruction experiments are conducted to verify this new method,and the results indicate that the reconstruction results of HFIC-Net method effectively improve reconstruction quality.This new method uses only eight-angle projections to achieve the reconstruction effect of the filtered backprojection method(FBP)method in 360 projections.The results of the HFIC-Net method demonstrate clear boundaries and accurate detailed structures,correcting the misinformation caused by using other methods.For quantitative evaluation,the SSIM used to evaluate image structure similarity is increased from 0.1951,0.9212,and 0.9308 for FBP,FBP-Conv,and DDC-Net,respectively,to 0.9620 for HFIC-Net.Finally,the results of actual SR-CT experimental data indicate that the new method can suppress artifacts and achieve accurate reconstruction,and it is suitable for the in situ SR-CT accurate characterization of ultxafast evolution process.展开更多
Convex feasibility problems are widely used in image reconstruction, sparse signal recovery, and other areas. This paper is devoted to considering a class of convex feasibility problem arising from sparse signal recov...Convex feasibility problems are widely used in image reconstruction, sparse signal recovery, and other areas. This paper is devoted to considering a class of convex feasibility problem arising from sparse signal recovery. We first derive the projection formulas for a vector onto the feasible sets. The centralized circumcentered-reflection method is designed to solve the convex feasibility problem. Some numerical experiments demonstrate the feasibility and effectiveness of the proposed algorithm, showing superior performance compared to conventional alternating projection methods.展开更多
Physics-informed neural networks(PINNs),as a novel artificial intelligence method for solving partial differential equations,are applicable to solve both forward and inverse problems.This study evaluates the performan...Physics-informed neural networks(PINNs),as a novel artificial intelligence method for solving partial differential equations,are applicable to solve both forward and inverse problems.This study evaluates the performance of PINNs in solving the temperature diffusion equation of the seawater across six scenarios,including forward and inverse problems under three different boundary conditions.Results demonstrate that PINNs achieved consistently higher accuracy with the Dirichlet and Neumann boundary conditions compared to the Robin boundary condition for both forward and inverse problems.Inaccurate weighting of terms in the loss function can reduce model accuracy.Additionally,the sensitivity of model performance to the positioning of sampling points varied between different boundary conditions.In particular,the model under the Dirichlet boundary condition exhibited superior robustness to variations in point positions during the solutions of inverse problems.In contrast,for the Neumann and Robin boundary conditions,accuracy declines when points were sampled from identical positions or at the same time.Subsequently,the Argo observations were used to reconstruct the vertical diffusion of seawater temperature in the north-central Pacific for the applicability of PINNs in the real ocean.The PINNs successfully captured the vertical diffusion characteristics of seawater temperature,reflected the seasonal changes of vertical temperature under different topographic conditions,and revealed the influence of topography on the temperature diffusion coefficient.The PINNs were proved effective in solving the temperature diffusion equation of seawater with limited data,providing a promising technique for simulating or predicting ocean phenomena using sparse observations.展开更多
The newly formulated non-Newtonian rivulet flows streaming down an inclined planar surface,with additional periodic perturbations arising from the application of the 2nd Stokes problem to the investigation of rivulet ...The newly formulated non-Newtonian rivulet flows streaming down an inclined planar surface,with additional periodic perturbations arising from the application of the 2nd Stokes problem to the investigation of rivulet dynamics,are demonstrated in the current research.Hereby,the 2nd Stokes problem assumes that the surface,with a thin shared layer of the fluid on it,oscillates in a harmonic manner along the x-axis of the rivulet flow,which coincides with the main flow direction streaming down the underlying surface.We obtain the exact extension of the rivulet flow family,clarifying the structure of the pressure field,which fully absorbs the arising perturbation.The profile of the velocity field is assumed to be Gaussian-type with a non-zero level of plasticity.Hence,the absolutely non-Newtonian case of the viscoplastic flow solution,which satisfies the motion and continuity equations,is considered(with particular cases of exact solutions for pressure).The perturbed governing equations of motion for rivulet flows then result in the Riccati-type ordinary differential equation(ODE),describing the dynamics of the coordinate x(t).The approximated schematic dynamics are presented in graphical plots.展开更多
This study proposes a class of augmented subspace schemes for the weak Galerkin(WG)finite element method used to solve eigenvalue problems.The augmented subspace is built with the conforming linear finite element spac...This study proposes a class of augmented subspace schemes for the weak Galerkin(WG)finite element method used to solve eigenvalue problems.The augmented subspace is built with the conforming linear finite element space defined on the coarse mesh and the eigen-function approximations in the WG finite element space defined on the fine mesh.Based on this augmented subspace,solving the eigenvalue problem in the fine WG finite element space can be reduced to the solution of the linear boundary value problem in the same WG finite element space and a low dimensional eigenvalue problem in the augmented sub-space.The proposed augmented subspace techniques have the second order convergence rate with respect to the coarse mesh size,as demonstrated by the accompanying error esti-mates.Finally,a few numerical examples are provided to validate the proposed numerical techniques.展开更多
In disaster relief operations,multiple UAVs can be used to search for trapped people.In recent years,many researchers have proposed machine le arning-based algorithms,sampling-based algorithms,and heuristic algorithms...In disaster relief operations,multiple UAVs can be used to search for trapped people.In recent years,many researchers have proposed machine le arning-based algorithms,sampling-based algorithms,and heuristic algorithms to solve the problem of multi-UAV path planning.The Dung Beetle Optimization(DBO)algorithm has been widely applied due to its diverse search patterns in the above algorithms.However,the update strategies for the rolling and thieving dung beetles of the DBO algorithm are overly simplistic,potentially leading to an inability to fully explore the search space and a tendency to converge to local optima,thereby not guaranteeing the discovery of the optimal path.To address these issues,we propose an improved DBO algorithm guided by the Landmark Operator(LODBO).Specifically,we first use tent mapping to update the population strategy,which enables the algorithm to generate initial solutions with enhanced diversity within the search space.Second,we expand the search range of the rolling ball dung beetle by using the landmark factor.Finally,by using the adaptive factor that changes with the number of iterations.,we improve the global search ability of the stealing dung beetle,making it more likely to escape from local optima.To verify the effectiveness of the proposed method,extensive simulation experiments are conducted,and the result shows that the LODBO algorithm can obtain the optimal path using the shortest time compared with the Genetic Algorithm(GA),the Gray Wolf Optimizer(GWO),the Whale Optimization Algorithm(WOA)and the original DBO algorithm in the disaster search and rescue task set.展开更多
Safe and efficient sortie scheduling on the confined flight deck is crucial for maintaining high combat effectiveness of the aircraft carrier.The primary difficulty exactly lies in the spatiotemporal coordination,i.e....Safe and efficient sortie scheduling on the confined flight deck is crucial for maintaining high combat effectiveness of the aircraft carrier.The primary difficulty exactly lies in the spatiotemporal coordination,i.e.,allocation of limited supporting resources and collision-avoidance between heterogeneous dispatch entities.In this paper,the problem is investigated in the perspective of hybrid flow-shop scheduling problem by synthesizing the precedence,space and resource constraints.Specifically,eight processing procedures are abstracted,where tractors,preparing spots,catapults,and launching are virtualized as machines.By analyzing the constraints in sortie scheduling,a mixed-integer planning model is constructed.In particular,the constraint on preparing spot occupancy is improved to further enhance the sortie efficiency.The basic trajectory library for each dispatch entity is generated and a delayed strategy is integrated to address the collision-avoidance issue.To efficiently solve the formulated HFSP,which is essentially a combinatorial problem with tightly coupled constraints,a chaos-initialized genetic algorithm is developed.The solution framework is validated by the simulation environment referring to the Fort-class carrier,exhibiting higher sortie efficiency when compared to existing strategies.And animation of the simulation results is available at www.bilibili.com/video/BV14t421A7Tt/.The study presents a promising supporting technique for autonomous flight deck operation in the foreseeable future,and can be easily extended to other supporting scenarios,e.g.,ammunition delivery and aircraft maintenance.展开更多
Brazil’s deforestation monitoring integrates accuracy and current monitoring for land use and land cover applications.Regular monitoring of deforestation and non-deforestation requires Sentinel-2 multispectral satell...Brazil’s deforestation monitoring integrates accuracy and current monitoring for land use and land cover applications.Regular monitoring of deforestation and non-deforestation requires Sentinel-2 multispectral satellite images of several bands at various frequencies,the mix of high-and low-resolution images that make object classification difficult because of the mixed pixel problem.Accuracy is impacted by the mixed pixel problem,which occurs when pixels belong to different classes and makes detection challenging.To identify mixed pixels,Band Math is used to merge numerous bands to generate a new band NDVI.Thresholding is used to analyze the edges of deforested and non-deforested areas.Segmentation is then used to analyze the pixels which helps to identify the number of mixed pixels to compute the deforested and non-deforested areas.Segmented image pixels are used to categorize the deforestation of the Brazilian Amazon Forest between 2019 and 2023.Verify how many pixels are mixed to improve accuracy and identify mixed pixel issues;compare the mixed and pure pixels of fuzzy clustering with the subtracted morphological image pixels.With the help of segmentation and clustering researchers effectively validate mixed pixels in a specific area.The proposed methodology is easy to analyze and helpful for an appropriate calculation of deforested and non-deforested areas.展开更多
基金supported by the Guizhou Provincial Science and Technology Projects[Basic Science of Guizhou-[2024]Youth 309,Guizhou Platform Talents[2021]1350-046]Zunyi Science and Technology Cooperation[HZ(2024)311]+3 种基金Funding of the Chinese Academy of Social Sciences(2024SYZH005)Peking University Longitudinal Scientific Research Technical Service Project(G-252)Guizhou Provincial Graduate Student Research Fund Project(2024YJSKYJJ339)Zunyi Medical University Graduate Research Fund Project(ZYK206).
文摘This study examines the mediating role of positive psychological capital and the moderating role of ethnicity in the relationship between mindfulness and internalizing/externalizing problems among adolescents.The study sample comprized Chinese adolescents(N=637 ethnic minority;females=40.97%,meam age=12.68,SD=0.49 years;N=636 Han;females=49.06%,mean age=12.71,SD=0.47 years).The participants completed the Child and Adolescent Mindfulness Measure,the Positive Psycap Questionnaire,and the Youth Self-Report.Results from the moderated mediation analysis showed mindfulness was negatively associated with both internalizing and externalizing problems.Ethnicity moderated the relationship between mindfulness and internalizing problems to be stronger for Han adolescents compared to ethnic minority adolescents.Psychological capital mediated the relationship between mindfulness and internalizing problems in both groups,with a negative direction.Findings support the Conservation of Resources theory and highlight mindfulness as a personal resource fostering adolescent well-being in multicultural contexts.
基金supported by the National Science and Technology Council,Taiwan,under grant no.NSTC 114-2221-E-197-005-MY3.
文摘With the development of technology,diffusion model-based solvers have shown significant promise in solving Combinatorial Optimization(CO)problems,particularly in tackling Non-deterministic Polynomial-time hard(NP-hard)problems such as the Traveling Salesman Problem(TSP).However,existing diffusion model-based solvers typically employ a fixed,uniform noise schedule(e.g.,linear or cosine annealing)across all training instances,failing to fully account for the unique characteristics of each problem instance.To address this challenge,we present GraphGuided Diffusion Solvers(GGDS),an enhanced method for improving graph-based diffusion models.GGDS leverages Graph Neural Networks(GNNs)to capture graph structural information embedded in node coordinates and adjacency matrices,dynamically adjusting the noise levels in the diffusion model.This study investigates the TSP by examining two distinct time-step noise generation strategies:cosine annealing and a Neural Network(NN)-based approach.We evaluate their performance across different problem scales,particularly after integrating graph structural information.Experimental results indicate that GGDS outperforms previous methods with average performance improvements of 18.7%,6.3%,and 88.7%on TSP-500,TSP-100,and TSP-50,respectively.Specifically,GGDS demonstrates superior performance on TSP-500 and TSP-50,while its performance on TSP-100 is either comparable to or slightly better than that of previous methods,depending on the chosen noise schedule and decoding strategy.
文摘Generalised reduced masses with a set of equations governing the three relative motions between two of 3-bodies in their gravitational field are established,of which the dynamic characteristics of 3-body dynamics,fundamental bases of this paper,are revealed.Based on these findings,an equivalent system is developed,which is a 2-body system with its total mass,constant angular momentum,kinetic and potential energies same as the total ones of three relative motions,so that it can be solved using the well-known theory of the 2-body system.From the solution of an equivalent system with the revealed characteristics of three relative motions,the general theoretical solutions of the 3-body system are obtained in the curve-integration forms along the orbits in the imaged radial motion space.The possible periodical orbits with generalised Kepler’s law are presented.Following the description and mathematical demonstrations of the proposed methods,the examples including Euler’s/Lagrange’s problems,and a reported numerical one are solved to validate the proposed methods.The methods derived from the 3-body system are extended to N-body problems.
基金supported by the start-up funding from Westlake University under Grant Number 041030150118 and the scientific research project of Westlake University“Theoretical Research and Demonstration Application of Complex Systems and Deep-Sea Technology(Phase I)”under Grant Number WU2025A006.
文摘Defining science and demarcating it from pseudoscience are longstanding core issues in the philosophy of science.Hilbert’s traditional axiomatic standards(consistency,completeness,independence)struggle with modern complex systems,while existing demarcation criteria like replicability and Popper’s falsificationism have practical limitations.Analyzing incompatibilities in complex systems,this paper proposes a revised framework:modified Hilbert axiomatic standards(clearly defined concepts,logical consistency,unrefuted axioms)and dynamic demarcation criteria.Abandoning unattainable traditional requirements of completeness and independence,it emphasizes conceptual clarity,openness,and progressiveness,offering an operational,self-consistent basis for judging scientificity.
文摘The proliferation of carrier aircraft and the integration of unmanned aerial vehicles(UAVs)on aircraft carriers present new challenges to the automation of launch and recovery operations.This paper investigates a collaborative scheduling problem inherent to the operational processes of carrier aircraft,where launch and recovery tasks are conducted concurrently on the flight deck.The objective is to minimize the cumulative weighted waiting time in the air for recovering aircraft and the cumulative weighted delay time for launching aircraft.To tackle this challenge,a multiple population self-adaptive differential evolution(MPSADE)algorithm is proposed.This method features a self-adaptive parameter updating mechanism that is contingent upon population diversity,an asynchronous updating scheme,an individual migration operator,and a global crossover mechanism.Additionally,comprehensive experiments are conducted to validate the effectiveness of the proposed model and algorithm.Ultimately,a comparative analysis with existing operation modes confirms the enhanced efficiency of the collaborative operation mode.
文摘Circumlunar abort trajectories constitute a vital contingency return strategy during the translunar phase of crewed lunar missions.This paper proposes a methodology for constructing the solution set of the circumlunar abort trajectory and leverages its advantageous properties to address the optimization design problem of abort trajectories.Initially,a solution set of all feasible abort trajectories,originating from an abort point on the nominal trajectory and complying with fundamental reentry constraints,is formulated through the introduction of two novel design parameters.Subsequently,the geometric characteristics of the solution set,as well as the distributional properties of key iterative constraint responses,including flight time and velocity increment,are analyzed.Finally,the characteristics exhibited in the solution set are employed to directly identify the design parameters of the abort trajectories with minimum flight time and velocity increment,thereby providing solutions to two distinct types of optimization problems.The simulation results for a variety of nominal trajectories,encompassing the reconstruction and redesign of the Apollo13 abort trajectory,validate the proposed method,demonstrating its ability to directly generate optimal abort trajectories.The method proposed in this paper investigates feasible abort trajectories from a global perspective,providing both a framework and convenience for mission planning and iterative optimization in abort trajectory design.
基金supported by the National Natural Sci‐ence Foundation of China(Grant No.62306325)。
文摘During the use of robotics in applications such as antiterrorism or combat,a motion-constrained pursuer vehicle,such as a Dubins unmanned surface vehicle(USV),must get close enough(within a prescribed zero or positive distance)to a moving target as quickly as possible,resulting in the extended minimum-time intercept problem(EMTIP).Existing research has primarily focused on the zero-distance intercept problem,MTIP,establishing the necessary or sufficient conditions for MTIP optimality,and utilizing analytic algorithms,such as root-finding algorithms,to calculate the optimal solutions.However,these approaches depend heavily on the properties of the analytic algorithm,making them inapplicable when problem settings change,such as in the case of a positive effective range or complicated target motions outside uniform rectilinear motion.In this study,an approach employing a high-accuracy and quality-guaranteed mixed-integer piecewise-linear program(QG-PWL)is proposed for the EMTIP.This program can accommodate different effective interception ranges and complicated target motions(variable velocity or complicated trajectories).The high accuracy and quality guarantees of QG-PWL originate from elegant strategies such as piecewise linearization and other developed operation strategies.The approximate error in the intercept path length is proved to be bounded to h^(2)/(4√2),where h is the piecewise length.
基金funded by National Natural Science Foundation of China(Nos.12402142,11832013 and 11572134)Natural Science Foundation of Hubei Province(No.2024AFB235)+1 种基金Hubei Provincial Department of Education Science and Technology Research Project(No.Q20221714)the Opening Foundation of Hubei Key Laboratory of Digital Textile Equipment(Nos.DTL2023019 and DTL2022012).
文摘Owing to their global search capabilities and gradient-free operation,metaheuristic algorithms are widely applied to a wide range of optimization problems.However,their computational demands become prohibitive when tackling high-dimensional optimization challenges.To effectively address these challenges,this study introduces cooperative metaheuristics integrating dynamic dimension reduction(DR).Building upon particle swarm optimization(PSO)and differential evolution(DE),the proposed cooperative methods C-PSO and C-DE are developed.In the proposed methods,the modified principal components analysis(PCA)is utilized to reduce the dimension of design variables,thereby decreasing computational costs.The dynamic DR strategy implements periodic execution of modified PCA after a fixed number of iterations,resulting in the important dimensions being dynamically identified.Compared with the static one,the dynamic DR strategy can achieve precise identification of important dimensions,thereby enabling accelerated convergence toward optimal solutions.Furthermore,the influence of cumulative contribution rate thresholds on optimization problems with different dimensions is investigated.Metaheuristic algorithms(PSO,DE)and cooperative metaheuristics(C-PSO,C-DE)are examined by 15 benchmark functions and two engineering design problems(speed reducer and composite pressure vessel).Comparative results demonstrate that the cooperative methods achieve significantly superior performance compared to standard methods in both solution accuracy and computational efficiency.Compared to standard metaheuristic algorithms,cooperative metaheuristics achieve a reduction in computational cost of at least 40%.The cooperative metaheuristics can be effectively used to tackle both high-dimensional unconstrained and constrained optimization problems.
基金supported by the High-Level Talent Foundation of Jinling Institute of Technology(grant number.JIT-B-202413).
文摘With the increasing severity of network security threats,Network Intrusion Detection(NID)has become a key technology to ensure network security.To address the problem of low detection rate of traditional intrusion detection models,this paper proposes a Dual-Attention model for NID,which combines Convolutional Neural Network(CNN)and Bidirectional Long Short-Term Memory(BiLSTM)to design two modules:the FocusConV and the TempoNet module.The FocusConV module,which automatically adjusts and weights CNN extracted local features,focuses on local features that are more important for intrusion detection.The TempoNet module focuses on global information,identifies more important features in time steps or sequences,and filters and weights the information globally to further improve the accuracy and robustness of NID.Meanwhile,in order to solve the class imbalance problem in the dataset,the EQL v2 method is used to compute the class weights of each class and to use them in the loss computation,which optimizes the performance of the model on the class imbalance problem.Extensive experiments were conducted on the NSL-KDD,UNSW-NB15,and CIC-DDos2019 datasets,achieving average accuracy rates of 99.66%,87.47%,and 99.39%,respectively,demonstrating excellent detection accuracy and robustness.The model also improves the detection performance of minority classes in the datasets.On the UNSW-NB15 dataset,the detection rates for Analysis,Exploits,and Shellcode attacks increased by 7%,7%,and 10%,respectively,demonstrating the Dual-Attention CNN-BiLSTM model’s excellent performance in NID.
基金supported by the National Key Research and Development Program of China(Grant No.2024YFA1408500)the National Natural Science Foundation of China(Grant Nos.12174028 and 12574115)the Open Fund of the State Key Laboratory of Spintronics Devices and Technologies(Grant No.SPL-2408)。
文摘We incorporate a non-Markovian feedback mechanism into the simulated bifurcation method for dynamical solvers addressing combinatorial optimization problems.By reinjecting a portion of dissipated kinetic energy into each spin in a history-dependent and trajectory-informed manner,the method effectively suppresses early freezing induced by inelastic boundaries and enhances the system's ability to explore complex energy landscapes.Numerical results on the maximum cut(MAX-CUT)instances of fully connected Sherrington–Kirkpatrick(SK)spin glass models,including the 2000-spin K_(2000)benchmark,demonstrate that the non-Markovian algorithm significantly improves both solution quality and convergence speed.Tests on randomly generated SK instances with 100 to 1000 spins further indicate favorable scalability and substantial gains in computational efficiency.Moreover,the proposed scheme is well suited for massively parallel hardware implementations,such as field-programmable gate arrays,providing a practical and scalable approach for solving large-scale combinatorial optimization problems.
基金Project supported by the Project of the Anhui Provincial Natural Science Foundation(Grant No.2308085MA19)Strategic Priority Research Program of the Chinese Academy of Sciences(Grant No.XDA0410401)+2 种基金the National Natural Science Foundation of China(Grant No.52202120)the National Key Research and Development Program of China(Grant No.2023YFA1609800)USTC Research Funds of the Double First-Class Initiative(Grant No.YD2310002013)。
文摘Small angle x-ray scattering(SAXS)is an advanced technique for characterizing the particle size distribution(PSD)of nanoparticles.However,the ill-posed nature of inverse problems in SAXS data analysis often reduces the accuracy of conventional methods.This article proposes a user-friendly software for PSD analysis,GranuSAS,which employs an algorithm that integrates truncated singular value decomposition(TSVD)with the Chahine method.This approach employs TSVD for data preprocessing,generating a set of initial solutions with noise suppression.A high-quality initial solution is subsequently selected via the L-curve method.This selected candidate solution is then iteratively refined by the Chahine algorithm,enforcing constraints such as non-negativity and improving physical interpretability.Most importantly,GranuSAS employs a parallel architecture that simultaneously yields inversion results from multiple shape models and,by evaluating the accuracy of each model's reconstructed scattering curve,offers a suggestion for model selection in material systems.To systematically validate the accuracy and efficiency of the software,verification was performed using both simulated and experimental datasets.The results demonstrate that the proposed software delivers both satisfactory accuracy and reliable computational efficiency.It provides an easy-to-use and reliable tool for researchers in materials science,helping them fully exploit the potential of SAXS in nanoparticle characterization.
基金supported by the National Nature Science Foundation of China(Nos.12027901 and 12041202)Synchrotron Radiation Joint Fund of University of Science and Technology of China(Nos.KY2090000059 and KY2090000054)。
文摘There is a contradiction between the evolution rate of materials and the time resolution of SR-CT characterization in the in situ synchrotron radiation computed tomography(SR-CT)characterization of ultrafast evolution process.The sampling strategy of the ultra-sparse angle is an effective method for improving time resolution.Accurate reconstruction under sparse sampling conditions has always been a bottleneck problem.In recent years,convolutional neural networks have shown outstanding advantages in sparse-angle CT reconstruction given the development of deep learning.However,existing ideas did not consider the expression of high-frequency details in neural networks,limiting their application in accurate SR-CT characterization.A novel high-frequency information-constrained deep learning network(HFIC-Net)is proposed in response to this problem.Additional high-frequency information constraints are added to improve the accuracy of the reconstruction results.Further,a series of numerical reconstruction experiments are conducted to verify this new method,and the results indicate that the reconstruction results of HFIC-Net method effectively improve reconstruction quality.This new method uses only eight-angle projections to achieve the reconstruction effect of the filtered backprojection method(FBP)method in 360 projections.The results of the HFIC-Net method demonstrate clear boundaries and accurate detailed structures,correcting the misinformation caused by using other methods.For quantitative evaluation,the SSIM used to evaluate image structure similarity is increased from 0.1951,0.9212,and 0.9308 for FBP,FBP-Conv,and DDC-Net,respectively,to 0.9620 for HFIC-Net.Finally,the results of actual SR-CT experimental data indicate that the new method can suppress artifacts and achieve accurate reconstruction,and it is suitable for the in situ SR-CT accurate characterization of ultxafast evolution process.
基金Supported by the Natural Science Foundation of Guangxi Province(Grant Nos.2023GXNSFAA026067,2024GXN SFAA010521)the National Natural Science Foundation of China(Nos.12361079,12201149,12261026).
文摘Convex feasibility problems are widely used in image reconstruction, sparse signal recovery, and other areas. This paper is devoted to considering a class of convex feasibility problem arising from sparse signal recovery. We first derive the projection formulas for a vector onto the feasible sets. The centralized circumcentered-reflection method is designed to solve the convex feasibility problem. Some numerical experiments demonstrate the feasibility and effectiveness of the proposed algorithm, showing superior performance compared to conventional alternating projection methods.
基金Supported by the National Key Research and Development Program of China(No.2023YFC3008200)the Independent Research Project of Southern Marine Science and Engineering Guangdong Laboratory(Zhuhai)(No.SML2022SP505)。
文摘Physics-informed neural networks(PINNs),as a novel artificial intelligence method for solving partial differential equations,are applicable to solve both forward and inverse problems.This study evaluates the performance of PINNs in solving the temperature diffusion equation of the seawater across six scenarios,including forward and inverse problems under three different boundary conditions.Results demonstrate that PINNs achieved consistently higher accuracy with the Dirichlet and Neumann boundary conditions compared to the Robin boundary condition for both forward and inverse problems.Inaccurate weighting of terms in the loss function can reduce model accuracy.Additionally,the sensitivity of model performance to the positioning of sampling points varied between different boundary conditions.In particular,the model under the Dirichlet boundary condition exhibited superior robustness to variations in point positions during the solutions of inverse problems.In contrast,for the Neumann and Robin boundary conditions,accuracy declines when points were sampled from identical positions or at the same time.Subsequently,the Argo observations were used to reconstruct the vertical diffusion of seawater temperature in the north-central Pacific for the applicability of PINNs in the real ocean.The PINNs successfully captured the vertical diffusion characteristics of seawater temperature,reflected the seasonal changes of vertical temperature under different topographic conditions,and revealed the influence of topography on the temperature diffusion coefficient.The PINNs were proved effective in solving the temperature diffusion equation of seawater with limited data,providing a promising technique for simulating or predicting ocean phenomena using sparse observations.
文摘The newly formulated non-Newtonian rivulet flows streaming down an inclined planar surface,with additional periodic perturbations arising from the application of the 2nd Stokes problem to the investigation of rivulet dynamics,are demonstrated in the current research.Hereby,the 2nd Stokes problem assumes that the surface,with a thin shared layer of the fluid on it,oscillates in a harmonic manner along the x-axis of the rivulet flow,which coincides with the main flow direction streaming down the underlying surface.We obtain the exact extension of the rivulet flow family,clarifying the structure of the pressure field,which fully absorbs the arising perturbation.The profile of the velocity field is assumed to be Gaussian-type with a non-zero level of plasticity.Hence,the absolutely non-Newtonian case of the viscoplastic flow solution,which satisfies the motion and continuity equations,is considered(with particular cases of exact solutions for pressure).The perturbed governing equations of motion for rivulet flows then result in the Riccati-type ordinary differential equation(ODE),describing the dynamics of the coordinate x(t).The approximated schematic dynamics are presented in graphical plots.
基金partly supported by the Beijing Natural Science Foundation(Grant No.Z200003)by the National Natural Science Foundation of China(Grant Nos.12331015,12301475,12301465)+1 种基金by the National Center for Mathematics and Interdisciplinary Science,Chinese Academy of Sciencesby the Research Foundation for the Beijing University of Technology New Faculty(Grant No.006000514122516).
文摘This study proposes a class of augmented subspace schemes for the weak Galerkin(WG)finite element method used to solve eigenvalue problems.The augmented subspace is built with the conforming linear finite element space defined on the coarse mesh and the eigen-function approximations in the WG finite element space defined on the fine mesh.Based on this augmented subspace,solving the eigenvalue problem in the fine WG finite element space can be reduced to the solution of the linear boundary value problem in the same WG finite element space and a low dimensional eigenvalue problem in the augmented sub-space.The proposed augmented subspace techniques have the second order convergence rate with respect to the coarse mesh size,as demonstrated by the accompanying error esti-mates.Finally,a few numerical examples are provided to validate the proposed numerical techniques.
基金supported by the National Natural Science Foundation of China(No.62373027).
文摘In disaster relief operations,multiple UAVs can be used to search for trapped people.In recent years,many researchers have proposed machine le arning-based algorithms,sampling-based algorithms,and heuristic algorithms to solve the problem of multi-UAV path planning.The Dung Beetle Optimization(DBO)algorithm has been widely applied due to its diverse search patterns in the above algorithms.However,the update strategies for the rolling and thieving dung beetles of the DBO algorithm are overly simplistic,potentially leading to an inability to fully explore the search space and a tendency to converge to local optima,thereby not guaranteeing the discovery of the optimal path.To address these issues,we propose an improved DBO algorithm guided by the Landmark Operator(LODBO).Specifically,we first use tent mapping to update the population strategy,which enables the algorithm to generate initial solutions with enhanced diversity within the search space.Second,we expand the search range of the rolling ball dung beetle by using the landmark factor.Finally,by using the adaptive factor that changes with the number of iterations.,we improve the global search ability of the stealing dung beetle,making it more likely to escape from local optima.To verify the effectiveness of the proposed method,extensive simulation experiments are conducted,and the result shows that the LODBO algorithm can obtain the optimal path using the shortest time compared with the Genetic Algorithm(GA),the Gray Wolf Optimizer(GWO),the Whale Optimization Algorithm(WOA)and the original DBO algorithm in the disaster search and rescue task set.
基金the financial support of the National Key Research and Development Plan(2021YFB3302501)the financial support of the National Natural Science Foundation of China(12102077)。
文摘Safe and efficient sortie scheduling on the confined flight deck is crucial for maintaining high combat effectiveness of the aircraft carrier.The primary difficulty exactly lies in the spatiotemporal coordination,i.e.,allocation of limited supporting resources and collision-avoidance between heterogeneous dispatch entities.In this paper,the problem is investigated in the perspective of hybrid flow-shop scheduling problem by synthesizing the precedence,space and resource constraints.Specifically,eight processing procedures are abstracted,where tractors,preparing spots,catapults,and launching are virtualized as machines.By analyzing the constraints in sortie scheduling,a mixed-integer planning model is constructed.In particular,the constraint on preparing spot occupancy is improved to further enhance the sortie efficiency.The basic trajectory library for each dispatch entity is generated and a delayed strategy is integrated to address the collision-avoidance issue.To efficiently solve the formulated HFSP,which is essentially a combinatorial problem with tightly coupled constraints,a chaos-initialized genetic algorithm is developed.The solution framework is validated by the simulation environment referring to the Fort-class carrier,exhibiting higher sortie efficiency when compared to existing strategies.And animation of the simulation results is available at www.bilibili.com/video/BV14t421A7Tt/.The study presents a promising supporting technique for autonomous flight deck operation in the foreseeable future,and can be easily extended to other supporting scenarios,e.g.,ammunition delivery and aircraft maintenance.
文摘Brazil’s deforestation monitoring integrates accuracy and current monitoring for land use and land cover applications.Regular monitoring of deforestation and non-deforestation requires Sentinel-2 multispectral satellite images of several bands at various frequencies,the mix of high-and low-resolution images that make object classification difficult because of the mixed pixel problem.Accuracy is impacted by the mixed pixel problem,which occurs when pixels belong to different classes and makes detection challenging.To identify mixed pixels,Band Math is used to merge numerous bands to generate a new band NDVI.Thresholding is used to analyze the edges of deforested and non-deforested areas.Segmentation is then used to analyze the pixels which helps to identify the number of mixed pixels to compute the deforested and non-deforested areas.Segmented image pixels are used to categorize the deforestation of the Brazilian Amazon Forest between 2019 and 2023.Verify how many pixels are mixed to improve accuracy and identify mixed pixel issues;compare the mixed and pure pixels of fuzzy clustering with the subtracted morphological image pixels.With the help of segmentation and clustering researchers effectively validate mixed pixels in a specific area.The proposed methodology is easy to analyze and helpful for an appropriate calculation of deforested and non-deforested areas.
