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.展开更多
Constraint satisfaction problems(CSPs)are a class of problems that are ubiquitous in science and engineering.They feature a collection of constraints specified over subsets of variables.A CSP can be solved either dire...Constraint satisfaction problems(CSPs)are a class of problems that are ubiquitous in science and engineering.They feature a collection of constraints specified over subsets of variables.A CSP can be solved either directly or by reducing it to other problems.This paper introduces the Julia ecosystem for solving and analyzing CSPs with a focus on the programming practices.We introduce some important CSPs and show how these problems are reduced to each other.We also show how to transform CSPs into tensor networks,how to optimize the tensor network contraction orders,and how to extract the solution space properties by contracting the tensor networks with generic element types.Examples are given,which include computing the entropy constant,analyzing the overlap gap property,and the reduction between CSPs.展开更多
Several results on iterative methods for equilibrium problems have been proposed and studied in the literature.Most of these results are obtained when the associated bifunction of the equilibrium problem is either a m...Several results on iterative methods for equilibrium problems have been proposed and studied in the literature.Most of these results are obtained when the associated bifunction of the equilibrium problem is either a monotone or pseudomonotone operator.Results on iterative methods for equilibrium problems without monotonicity conditions on the bifunction are still few in the literature.In this paper,we study equilibrium problems for which the underlined bifunction is not assumed any form of monotonicity.We propose two weakly convergent iterative algorithms and one strongly convergent algorithm.We obtain our convergence results without assuming either monotonicity or pseudomonotonicity condition on the bifunction.Our proposed algorithms are tested numerically to be more efficient and faster than some few available algorithms for equilibrium problems without monotonicity in the literature.展开更多
This study addresses the Unmanned Aerial Vehicle routing problems with profits,which requires balancing mission profit,path efficiency,and battery health under complex constraints,particularly the nonlinear degradatio...This study addresses the Unmanned Aerial Vehicle routing problems with profits,which requires balancing mission profit,path efficiency,and battery health under complex constraints,particularly the nonlinear degradation of batteries.This paper proposes an enhanced memetic algorithm by integrating adaptive local search and a dynamic population management mechanism.The algorithm employs a hybrid initialization strategy to generate high-quality initial solutions.It incorporates an improved linear crossover operator to preserve beneficial path characteristics and introduces dynamically probability-controlled local search to optimize solution quality.To enhance global exploration capability,a population screening mechanism based on solution similarity and a population restart strategy simulating biological mass extinction are designed.Extensive experiments conducted on standard Tsiligirides's and Chao's datasets demonstrate the algorithm's robust performance across scenarios ranging from 21 to 66 nodes and time constraints spanning 5 to 130 minutes.The algorithm attains 95%accuracy relative to maximum total score within 30 iterations,surpassing 99%accuracy after 100 iterations.Its comprehensive performance significantly surpasses that of traditional heuristic methods.The proposed method provides an efficient and robust solution for Unmanned Aerial Vehicle routing planning under intricate constraints.展开更多
In this paper,the physics informed neural network(PINN)deep learning method is applied to solve two-dimensional nonlocal equations,including the partial reverse space y-nonlocal Mel'nikov equation,the partial reve...In this paper,the physics informed neural network(PINN)deep learning method is applied to solve two-dimensional nonlocal equations,including the partial reverse space y-nonlocal Mel'nikov equation,the partial reverse space-time nonlocal Mel'nikov equation and the nonlocal twodimensional nonlinear Schr?dinger(NLS)equation.By the PINN method,we successfully derive a data-driven two soliton solution,lump solution and rogue wave solution.Numerical simulation results indicate that the error range between the data-driven solution and the exact solution is relatively small,which verifies the effectiveness of the PINN deep learning method for solving high dimensional nonlocal equations.Moreover,the parameter discovery of the partial reverse space-time nonlocal Mel'nikov equation is analysed in terms of its soliton solution for the first time.展开更多
The knapsack problem is a classical combinatorial optimization problem widely encountered in areas such as logistics,resource allocation,and portfolio optimization.Traditional methods,including dynamic program-ming(DP...The knapsack problem is a classical combinatorial optimization problem widely encountered in areas such as logistics,resource allocation,and portfolio optimization.Traditional methods,including dynamic program-ming(DP)and greedy algorithms,have been effective in solving small problem instances but often struggle with scalability and efficiency as the problem size increases.DP,for instance,has exponential time complexity and can become computationally prohibitive for large problem instances.On the other hand,greedy algorithms offer faster solutions but may not always yield the optimal results,especially when the problem involves complex constraints or large numbers of items.This paper introduces a novel reinforcement learning(RL)approach to solve the knapsack problem by enhancing the state representation within the learning environment.We propose a representation where item weights and volumes are expressed as ratios relative to the knapsack’s capacity,and item values are normalized to represent their percentage of the total value across all items.This novel state modification leads to a 5%improvement in accuracy compared to the state-of-the-art RL-based algorithms,while significantly reducing execution time.Our RL-based method outperforms DP by over 9000 times in terms of speed,making it highly scalable for larger problem instances.Furthermore,we improve the performance of the RL model by incorporating Noisy layers into the neural network architecture.The addition of Noisy layers enhances the exploration capabilities of the agent,resulting in an additional accuracy boost of 0.2%–0.5%.The results demonstrate that our approach not only outperforms existing RL techniques,such as the Transformer model in terms of accuracy,but also provides a substantial improvement than DP in computational efficiency.This combination of enhanced accuracy and speed presents a promising solution for tackling large-scale optimization problems in real-world applications,where both precision and time are critical factors.展开更多
Enforcing initial and boundary conditions(I/BCs)poses challenges in physics-informed neural networks(PINNs).Several PINN studies have gained significant achievements in developing techniques for imposing BCs in static...Enforcing initial and boundary conditions(I/BCs)poses challenges in physics-informed neural networks(PINNs).Several PINN studies have gained significant achievements in developing techniques for imposing BCs in static problems;however,the simultaneous enforcement of I/BCs in dynamic problems remains challenging.To overcome this limitation,a novel approach called decoupled physics-informed neural network(d PINN)is proposed in this work.The d PINN operates based on the core idea of converting a partial differential equation(PDE)to a system of ordinary differential equations(ODEs)via the space-time decoupled formulation.To this end,the latent solution is expressed in the form of a linear combination of approximation functions and coefficients,where approximation functions are admissible and coefficients are unknowns of time that must be solved.Subsequently,the system of ODEs is obtained by implementing the weighted-residual form of the original PDE over the spatial domain.A multi-network structure is used to parameterize the set of coefficient functions,and the loss function of d PINN is established based on minimizing the residuals of the gained ODEs.In this scheme,the decoupled formulation leads to the independent handling of I/BCs.Accordingly,the BCs are automatically satisfied based on suitable selections of admissible functions.Meanwhile,the original ICs are replaced by the Galerkin form of the ICs concerning unknown coefficients,and the neural network(NN)outputs are modified to satisfy the gained ICs.Several benchmark problems involving different types of PDEs and I/BCs are used to demonstrate the superior performance of d PINN compared with regular PINN in terms of solution accuracy and computational cost.展开更多
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.展开更多
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.展开更多
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.展开更多
The Vehicle Routing Problem with Time Windows(VRPTW)presents a significant challenge in combinatorial optimization,especially under real-world uncertainties such as variable travel times,service durations,and dynamic ...The Vehicle Routing Problem with Time Windows(VRPTW)presents a significant challenge in combinatorial optimization,especially under real-world uncertainties such as variable travel times,service durations,and dynamic customer demands.These uncertainties make traditional deterministic models inadequate,often leading to suboptimal or infeasible solutions.To address these challenges,this work proposes an adaptive hybrid metaheuristic that integrates Genetic Algorithms(GA)with Local Search(LS),while incorporating stochastic uncertainty modeling through probabilistic travel times.The proposed algorithm dynamically adjusts parameters—such as mutation rate and local search probability—based on real-time search performance.This adaptivity enhances the algorithm’s ability to balance exploration and exploitation during the optimization process.Travel time uncertainties are modeled using Gaussian noise,and solution robustness is evaluated through scenario-based simulations.We test our method on a set of benchmark problems from Solomon’s instance suite,comparing its performance under deterministic and stochastic conditions.Results show that the proposed hybrid approach achieves up to a 9%reduction in expected total travel time and a 40% reduction in time window violations compared to baseline methods,including classical GA and non-adaptive hybrids.Additionally,the algorithm demonstrates strong robustness,with lower solution variance across uncertainty scenarios,and converges faster than competing approaches.These findings highlight the method’s suitability for practical logistics applications such as last-mile delivery and real-time transportation planning,where uncertainty and service-level constraints are critical.The flexibility and effectiveness of the proposed framework make it a promising candidate for deployment in dynamic,uncertainty-aware supply chain environments.展开更多
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.展开更多
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.展开更多
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.展开更多
Objectives:Near misses happen more frequently than actual errors,and highlight system vulnerabilities without causing any harm,thus provide a safe space for organizational learning.Second-order problem solving behavio...Objectives:Near misses happen more frequently than actual errors,and highlight system vulnerabilities without causing any harm,thus provide a safe space for organizational learning.Second-order problem solving behavior offers a new perspective to better understand how nurses promote learning from near misses to improve organizational outcomes.This study aimed to explore frontline nurses’perspectives on using second-order problem solving behavior in learning from near misses to improve patient safety.Methods:A qualitative exploratory study design was employed.This study was conducted in three tertiary hospitals in east China from June to November 2015.Purposive sampling was used to recruit 19 frontline nurses.Semi-structured interviews and a qualitative directed content analysis was undertaken using Crossan’s 4I Framework of Organizational Learning as a coding framework.Results:Second-order problem solving behavior,based on the 4I Framework of Organizational Learning,was referred to as being a leader in exposing near misses,pushing forward the cause analysis within limited capacity,balancing the active and passive role during improvement project,and promoting the continuous improvement with passion while feeling low-powered.Conclusions:4I Framework of Organizational Learning can be an underlying guide to enrich frontline nurses’role in promoting organizations to learn from near misses.In this study,nurses displayed their pivotal role in organizational learning from near misses by using second-order problem solving.However,additional knowledge,skills,and support are needed to maximize the application of second-order problem solving behavior when near misses are recognized.展开更多
BACKGROUND The use of a problem-solving model guided by stimulus-organism-response(SOR)theory for women with postpartum depression after cesarean delivery may inform nursing interventions for women with postpartum dep...BACKGROUND The use of a problem-solving model guided by stimulus-organism-response(SOR)theory for women with postpartum depression after cesarean delivery may inform nursing interventions for women with postpartum depression.AIM To explore the state of mind and coping style of women with depression after cesarean delivery guided by SOR theory.METHODS Eighty postpartum depressed women with cesarean delivery admitted to the hospital between January 2022 and October 2023 were selected and divided into two groups of 40 cases each,according to the random number table method.In the control group,the observation group adopted the problem-solving nursing model under SOR theory.The two groups were consecutively intervened for 12 weeks,and the state of mind,coping styles,and degree of post-partum depression were analyzed at the end of the intervention.RESULTS The Edinburgh Postnatal Depression Scale and Hamilton Depression Scale-24-item scores of the observation group were lower than in the control group after care,and the level of improvement in the state of mind was higher than that of the control group(P<0.05).The level of coping with illness in the observation group after care(26.48±3.35)was higher than that in the control group(21.73±3.20),and the level of avoidance(12.04±2.68)and submission(8.14±1.15)was lower than that in the control group(15.75±2.69 and 9.95±1.20),with significant differences(P<0.05).CONCLUSION Adopting the problem-solving nursing model using SOR theory for postpartum depressed mothers after cesarean delivery reduced maternal depression,improved their state of mind,and coping level with illness.展开更多
Axiomatic design (AD) and theory of inventive problem solving (TRIZ) are widely used in conceptual design. Both of them have limitations, however. We presented an integrated model of these two methods to increase the ...Axiomatic design (AD) and theory of inventive problem solving (TRIZ) are widely used in conceptual design. Both of them have limitations, however. We presented an integrated model of these two methods to increase the efficiency and quality of the problem solving process for conceptual design. AD is used for systematically defining and structuring a problem into a hierarchy. Sometimes, the design matrix is coupled in AD which indicates the functional requirements are coupled. TRIZ separation principles can be used to separate non-independent design parameters, which provide innovative solutions at each hierarchical level. We applied the integrated model to the heating and drying equipment of bitumen reproduction device. The result verifies that the integrated model can work very well in conceptual design.展开更多
基金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.
基金funded by the National Key R&D Program of China(Grant No.2024YFE0102500)the National Natural Science Foundation of China(Grant No.12404568)+1 种基金the Guangzhou Municipal Science and Technology Project(Grant No.2023A03J00904)the Quantum Science Center of Guangdong-Hong Kong-Macao Greater Bay Area,China and the Undergraduate Research Project from HKUST(Guangzhou).
文摘Constraint satisfaction problems(CSPs)are a class of problems that are ubiquitous in science and engineering.They feature a collection of constraints specified over subsets of variables.A CSP can be solved either directly or by reducing it to other problems.This paper introduces the Julia ecosystem for solving and analyzing CSPs with a focus on the programming practices.We introduce some important CSPs and show how these problems are reduced to each other.We also show how to transform CSPs into tensor networks,how to optimize the tensor network contraction orders,and how to extract the solution space properties by contracting the tensor networks with generic element types.Examples are given,which include computing the entropy constant,analyzing the overlap gap property,and the reduction between CSPs.
文摘Several results on iterative methods for equilibrium problems have been proposed and studied in the literature.Most of these results are obtained when the associated bifunction of the equilibrium problem is either a monotone or pseudomonotone operator.Results on iterative methods for equilibrium problems without monotonicity conditions on the bifunction are still few in the literature.In this paper,we study equilibrium problems for which the underlined bifunction is not assumed any form of monotonicity.We propose two weakly convergent iterative algorithms and one strongly convergent algorithm.We obtain our convergence results without assuming either monotonicity or pseudomonotonicity condition on the bifunction.Our proposed algorithms are tested numerically to be more efficient and faster than some few available algorithms for equilibrium problems without monotonicity in the literature.
基金funded by Ministry of Education,grant number 2024120910911.
文摘This study addresses the Unmanned Aerial Vehicle routing problems with profits,which requires balancing mission profit,path efficiency,and battery health under complex constraints,particularly the nonlinear degradation of batteries.This paper proposes an enhanced memetic algorithm by integrating adaptive local search and a dynamic population management mechanism.The algorithm employs a hybrid initialization strategy to generate high-quality initial solutions.It incorporates an improved linear crossover operator to preserve beneficial path characteristics and introduces dynamically probability-controlled local search to optimize solution quality.To enhance global exploration capability,a population screening mechanism based on solution similarity and a population restart strategy simulating biological mass extinction are designed.Extensive experiments conducted on standard Tsiligirides's and Chao's datasets demonstrate the algorithm's robust performance across scenarios ranging from 21 to 66 nodes and time constraints spanning 5 to 130 minutes.The algorithm attains 95%accuracy relative to maximum total score within 30 iterations,surpassing 99%accuracy after 100 iterations.Its comprehensive performance significantly surpasses that of traditional heuristic methods.The proposed method provides an efficient and robust solution for Unmanned Aerial Vehicle routing planning under intricate constraints.
文摘In this paper,the physics informed neural network(PINN)deep learning method is applied to solve two-dimensional nonlocal equations,including the partial reverse space y-nonlocal Mel'nikov equation,the partial reverse space-time nonlocal Mel'nikov equation and the nonlocal twodimensional nonlinear Schr?dinger(NLS)equation.By the PINN method,we successfully derive a data-driven two soliton solution,lump solution and rogue wave solution.Numerical simulation results indicate that the error range between the data-driven solution and the exact solution is relatively small,which verifies the effectiveness of the PINN deep learning method for solving high dimensional nonlocal equations.Moreover,the parameter discovery of the partial reverse space-time nonlocal Mel'nikov equation is analysed in terms of its soliton solution for the first time.
基金supported in part by the Research Start-Up Funds of South-Central Minzu University under Grants YZZ23002,YZY23001,and YZZ18006in part by the Hubei Provincial Natural Science Foundation of China under Grants 2024AFB842 and 2023AFB202+3 种基金in part by the Knowledge Innovation Program of Wuhan Basic Research underGrant 2023010201010151in part by the Spring Sunshine Program of Ministry of Education of the People’s Republic of China under Grant HZKY20220331in part by the Funds for Academic Innovation Teams and Research Platformof South-CentralMinzu University Grant Number:XT224003,PTZ24001in part by the Career Development Fund(CDF)of the Agency for Science,Technology and Research(A*STAR)(Grant Number:C233312007).
文摘The knapsack problem is a classical combinatorial optimization problem widely encountered in areas such as logistics,resource allocation,and portfolio optimization.Traditional methods,including dynamic program-ming(DP)and greedy algorithms,have been effective in solving small problem instances but often struggle with scalability and efficiency as the problem size increases.DP,for instance,has exponential time complexity and can become computationally prohibitive for large problem instances.On the other hand,greedy algorithms offer faster solutions but may not always yield the optimal results,especially when the problem involves complex constraints or large numbers of items.This paper introduces a novel reinforcement learning(RL)approach to solve the knapsack problem by enhancing the state representation within the learning environment.We propose a representation where item weights and volumes are expressed as ratios relative to the knapsack’s capacity,and item values are normalized to represent their percentage of the total value across all items.This novel state modification leads to a 5%improvement in accuracy compared to the state-of-the-art RL-based algorithms,while significantly reducing execution time.Our RL-based method outperforms DP by over 9000 times in terms of speed,making it highly scalable for larger problem instances.Furthermore,we improve the performance of the RL model by incorporating Noisy layers into the neural network architecture.The addition of Noisy layers enhances the exploration capabilities of the agent,resulting in an additional accuracy boost of 0.2%–0.5%.The results demonstrate that our approach not only outperforms existing RL techniques,such as the Transformer model in terms of accuracy,but also provides a substantial improvement than DP in computational efficiency.This combination of enhanced accuracy and speed presents a promising solution for tackling large-scale optimization problems in real-world applications,where both precision and time are critical factors.
基金Project supported by the Basic Science Research Program through the National Research Foundation(NRF)of Korea funded by the Ministry of Science and ICT(No.RS-2024-00337001)。
文摘Enforcing initial and boundary conditions(I/BCs)poses challenges in physics-informed neural networks(PINNs).Several PINN studies have gained significant achievements in developing techniques for imposing BCs in static problems;however,the simultaneous enforcement of I/BCs in dynamic problems remains challenging.To overcome this limitation,a novel approach called decoupled physics-informed neural network(d PINN)is proposed in this work.The d PINN operates based on the core idea of converting a partial differential equation(PDE)to a system of ordinary differential equations(ODEs)via the space-time decoupled formulation.To this end,the latent solution is expressed in the form of a linear combination of approximation functions and coefficients,where approximation functions are admissible and coefficients are unknowns of time that must be solved.Subsequently,the system of ODEs is obtained by implementing the weighted-residual form of the original PDE over the spatial domain.A multi-network structure is used to parameterize the set of coefficient functions,and the loss function of d PINN is established based on minimizing the residuals of the gained ODEs.In this scheme,the decoupled formulation leads to the independent handling of I/BCs.Accordingly,the BCs are automatically satisfied based on suitable selections of admissible functions.Meanwhile,the original ICs are replaced by the Galerkin form of the ICs concerning unknown coefficients,and the neural network(NN)outputs are modified to satisfy the gained ICs.Several benchmark problems involving different types of PDEs and I/BCs are used to demonstrate the superior performance of d PINN compared with regular PINN in terms of solution accuracy and computational cost.
基金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.
基金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.
文摘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.
文摘The Vehicle Routing Problem with Time Windows(VRPTW)presents a significant challenge in combinatorial optimization,especially under real-world uncertainties such as variable travel times,service durations,and dynamic customer demands.These uncertainties make traditional deterministic models inadequate,often leading to suboptimal or infeasible solutions.To address these challenges,this work proposes an adaptive hybrid metaheuristic that integrates Genetic Algorithms(GA)with Local Search(LS),while incorporating stochastic uncertainty modeling through probabilistic travel times.The proposed algorithm dynamically adjusts parameters—such as mutation rate and local search probability—based on real-time search performance.This adaptivity enhances the algorithm’s ability to balance exploration and exploitation during the optimization process.Travel time uncertainties are modeled using Gaussian noise,and solution robustness is evaluated through scenario-based simulations.We test our method on a set of benchmark problems from Solomon’s instance suite,comparing its performance under deterministic and stochastic conditions.Results show that the proposed hybrid approach achieves up to a 9%reduction in expected total travel time and a 40% reduction in time window violations compared to baseline methods,including classical GA and non-adaptive hybrids.Additionally,the algorithm demonstrates strong robustness,with lower solution variance across uncertainty scenarios,and converges faster than competing approaches.These findings highlight the method’s suitability for practical logistics applications such as last-mile delivery and real-time transportation planning,where uncertainty and service-level constraints are critical.The flexibility and effectiveness of the proposed framework make it a promising candidate for deployment in dynamic,uncertainty-aware supply chain environments.
文摘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.
基金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 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.
文摘Objectives:Near misses happen more frequently than actual errors,and highlight system vulnerabilities without causing any harm,thus provide a safe space for organizational learning.Second-order problem solving behavior offers a new perspective to better understand how nurses promote learning from near misses to improve organizational outcomes.This study aimed to explore frontline nurses’perspectives on using second-order problem solving behavior in learning from near misses to improve patient safety.Methods:A qualitative exploratory study design was employed.This study was conducted in three tertiary hospitals in east China from June to November 2015.Purposive sampling was used to recruit 19 frontline nurses.Semi-structured interviews and a qualitative directed content analysis was undertaken using Crossan’s 4I Framework of Organizational Learning as a coding framework.Results:Second-order problem solving behavior,based on the 4I Framework of Organizational Learning,was referred to as being a leader in exposing near misses,pushing forward the cause analysis within limited capacity,balancing the active and passive role during improvement project,and promoting the continuous improvement with passion while feeling low-powered.Conclusions:4I Framework of Organizational Learning can be an underlying guide to enrich frontline nurses’role in promoting organizations to learn from near misses.In this study,nurses displayed their pivotal role in organizational learning from near misses by using second-order problem solving.However,additional knowledge,skills,and support are needed to maximize the application of second-order problem solving behavior when near misses are recognized.
文摘BACKGROUND The use of a problem-solving model guided by stimulus-organism-response(SOR)theory for women with postpartum depression after cesarean delivery may inform nursing interventions for women with postpartum depression.AIM To explore the state of mind and coping style of women with depression after cesarean delivery guided by SOR theory.METHODS Eighty postpartum depressed women with cesarean delivery admitted to the hospital between January 2022 and October 2023 were selected and divided into two groups of 40 cases each,according to the random number table method.In the control group,the observation group adopted the problem-solving nursing model under SOR theory.The two groups were consecutively intervened for 12 weeks,and the state of mind,coping styles,and degree of post-partum depression were analyzed at the end of the intervention.RESULTS The Edinburgh Postnatal Depression Scale and Hamilton Depression Scale-24-item scores of the observation group were lower than in the control group after care,and the level of improvement in the state of mind was higher than that of the control group(P<0.05).The level of coping with illness in the observation group after care(26.48±3.35)was higher than that in the control group(21.73±3.20),and the level of avoidance(12.04±2.68)and submission(8.14±1.15)was lower than that in the control group(15.75±2.69 and 9.95±1.20),with significant differences(P<0.05).CONCLUSION Adopting the problem-solving nursing model using SOR theory for postpartum depressed mothers after cesarean delivery reduced maternal depression,improved their state of mind,and coping level with illness.
基金Funded by the Natural Science Foundation of China (No. 50575083)
文摘Axiomatic design (AD) and theory of inventive problem solving (TRIZ) are widely used in conceptual design. Both of them have limitations, however. We presented an integrated model of these two methods to increase the efficiency and quality of the problem solving process for conceptual design. AD is used for systematically defining and structuring a problem into a hierarchy. Sometimes, the design matrix is coupled in AD which indicates the functional requirements are coupled. TRIZ separation principles can be used to separate non-independent design parameters, which provide innovative solutions at each hierarchical level. We applied the integrated model to the heating and drying equipment of bitumen reproduction device. The result verifies that the integrated model can work very well in conceptual design.
