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.展开更多
Two classes of mixed-integer nonlinear bilevel programming problems are discussed. One is that the follower＇s functions are separable with respect to the follower＇s variables, and the other is that the follower＇s f...Two classes of mixed-integer nonlinear bilevel programming problems are discussed. One is that the follower＇s functions are separable with respect to the follower＇s variables, and the other is that the follower＇s functions are convex if the follower＇s variables are not restricted to integers. A genetic algorithm based on an exponential distribution is proposed for the aforementioned problems. First, for each fixed leader＇s variable x, it is proved that the optimal solution y of the follower＇s mixed-integer programming can be obtained by solving associated relaxed problems, and according to the convexity of the functions involved, a simplified branch and bound approach is given to solve the follower＇s programming for the second class of problems. Furthermore, based on an exponential distribution with a parameter λ, a new crossover operator is designed in which the best individuals are used to generate better offspring of crossover. The simulation results illustrate that the proposed algorithm is efficient and robust.展开更多
It is extremely challenging to solve the mixed-integer optimal control problems(MIOCPs)due to the complex computation in solving the integer decision variables.This paper presents a new method based on quantum anneali...It is extremely challenging to solve the mixed-integer optimal control problems(MIOCPs)due to the complex computation in solving the integer decision variables.This paper presents a new method based on quantum annealing(QA)to solve MIOCP.The QA is a metaheuristic which applies quantum tunneling in the annealing process.It has a faster convergence speed in optimal-searching and is less likely to run into local minima.Hence,QA is applied to deal with this kind of optimization problems.First,MIOCP is transformed into a mixed-integer nonlinear programming(MINLP).Then,a method based on QA is adopted to solve the MINLP and acquire the optimal solution.At last,two benchmark examples including Lotka-Volterra type fishing problem and distillation column are presented and solved.The effectiveness of the metliodology is verified by the acquired optimal schemes.展开更多
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.展开更多
The double row layout problem(DRLP)is to assign facilities on two rows in parallel so that the total cost of material handling among facilities is minimized.Since it is vital to save cost and enhance productivity,the ...The double row layout problem(DRLP)is to assign facilities on two rows in parallel so that the total cost of material handling among facilities is minimized.Since it is vital to save cost and enhance productivity,the DRLP plays an important role in many application fields.Nevertheless,it is very hard to handle the DRLP because of its complex model.In this paper,we consider a new simplified model for the DRLP(SM-DRLP)and provide a mixed integer programming(MIP)formulation for it.The continuous decision variables of the DRLP are divided into two parts:start points of double rows and adjustable clearances between adjacent facilities.The former one is considered in the new simplified model for the DRLP with the purpose of maintaining solution quality,while the latter one is not taken into account with the purpose of reducing computational time.To evaluate its performance,our SM-DRLP is compared with the model of a general DRLP and the model of another simplified DRLP.The experimental results show the efficiency of our proposed model.展开更多
In educational settings,instructors often lead students through hands-on software projects,sometimes engaging two different schools or departments.How can such collaborations be made more efficient,and how can student...In educational settings,instructors often lead students through hands-on software projects,sometimes engaging two different schools or departments.How can such collaborations be made more efficient,and how can students truly experience the importance of teamwork and the impact of organizational structure on project complexity?To answer these questions,we introduce the requirement-driven organization structure(R-DOS)approach,which tightly couples software requirements with the actual development process.By extending problem-frames modeling and focusing on requirements,R-DOS allows educators and students to(1)diagnose structural flaws early,(2)prescribe role-level and communication fixes,and(3)observe-in real time-how poor structure can derail a project while good structure accelerates learning and delivery.展开更多
Cubic-shaped magnetic particles subjected to a dimensionless uniaxial anisotropy(Q=0.1)aligned with one of the crystallographic axes provide an ideal system for investigating magnetic equilibrium states.In this system...Cubic-shaped magnetic particles subjected to a dimensionless uniaxial anisotropy(Q=0.1)aligned with one of the crystallographic axes provide an ideal system for investigating magnetic equilibrium states.In this system,three fundamental magnetization configurations are identified:(i)the flower state,(ii)the twisted flower state,and(iii)the vortex state.This problem corresponds to standard problem No.3 proposed by the NIST Micromagnetics Modeling Group,widely adopted as a benchmark for validating computational micromagnetics methods.In this work,we approach the problem using a computational method based on direct dipolar interactions,in contrast to conventional techniques that typically compute the demagnetizing field via finite difference-based fast Fourier transform(FFT)methods,tensor grid approaches,or finite element formulations.Our results are compared with established literature data,focusing on the dimensionless parameterλ=L/l_(ex),where L is the cube edge length and l_(ex)is the exchange length of the material.To analyze equilibrium state transitions,we systematically varied the size L as a function of the simulation cell number N and intercellular spacing a,determining the criticalλvalue associated with configuration changes.Our simulations reveal that the transition between the twisted flower and vortex states occurs atλ≈8.45,consistent with values reported in the literature,validating our code(Grupo de Física da Matéeria Condensada-UFJF),and shows that this standard problem can be resolved using only interaction dipolar of a direct way without the need for sophisticated additional calculations.展开更多
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.展开更多
In this paper,we study the nonlinear Riemann boundary value problem with square roots that is represented by a Cauchy-type integral with kernel density in variable exponent Lebesgue spaces.We discuss the odd-order zer...In this paper,we study the nonlinear Riemann boundary value problem with square roots that is represented by a Cauchy-type integral with kernel density in variable exponent Lebesgue spaces.We discuss the odd-order zero-points distribution of the solutions and separate the single valued analytic branch of the solutions with square roots,then convert the problem to a Riemann boundary value problem in variable exponent Lebesgue spaces and discuss the singularity of solutions at individual zeros belonging to curve.We consider two types of cases those where the coefficient is Hölder and those where it is piecewise Hölder.Then we solve the Hilbert boundary value problem with square roots in variable exponent Lebesgue spaces.By discussing the distribution of the odd-order zero-points for solutions and the method of symmetric extension,we convert the Hilbert problem to a Riemann boundary value problem.The equivalence of the transformation is discussed.Finally,we get the solvable conditions and the direct expressions of the solutions in variable exponent Lebesgue spaces.展开更多
The airplane refueling problem can be stated as follows.We are given n airplanes which can refuel one another during the flight.Each airplane has a reservoir volume wj(liters)and a consumption rate pj(liters per kilom...The airplane refueling problem can be stated as follows.We are given n airplanes which can refuel one another during the flight.Each airplane has a reservoir volume wj(liters)and a consumption rate pj(liters per kilometer).As soon as one airplane runs out of fuel,it is dropping out of the flight.The problem asks for finding a refueling scheme such that the last plane in the air reach a maximal distance.An equivalent version is the n-vehicle exploration problem.The computational complexity of this non-linear combinatorial optimization problem is open so far.This paper employs the neighborhood exchange method of single-machine scheduling to study the precedence relations of jobs,so as to improve the necessary and sufficiency conditions of optimal solutions,and establish an efficient heuristic algorithm which is a generalization of several existing special algorithms.展开更多
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.展开更多
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.展开更多
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.展开更多
Physics-informed neural networks(PINNs)have been shown as powerful tools for solving partial differential equations(PDEs)by embedding physical laws into the network training.Despite their remarkable results,complicate...Physics-informed neural networks(PINNs)have been shown as powerful tools for solving partial differential equations(PDEs)by embedding physical laws into the network training.Despite their remarkable results,complicated problems such as irregular boundary conditions(BCs)and discontinuous or high-frequency behaviors remain persistent challenges for PINNs.For these reasons,we propose a novel two-phase framework,where a neural network is first trained to represent shape functions that can capture the irregularity of BCs in the first phase,and then these neural network-based shape functions are used to construct boundary shape functions(BSFs)that exactly satisfy both essential and natural BCs in PINNs in the second phase.This scheme is integrated into both the strong-form and energy PINN approaches,thereby improving the quality of solution prediction in the cases of irregular BCs.In addition,this study examines the benefits and limitations of these approaches in handling discontinuous and high-frequency problems.Overall,our method offers a unified and flexible solution framework that addresses key limitations of existing PINN methods with higher accuracy and stability for general PDE problems in solid mechanics.展开更多
The multi-objective optimization problems,especially in constrained environments such as power distribution planning,demand robust strategies for discovering effective solutions.This work presents the improved variant...The multi-objective optimization problems,especially in constrained environments such as power distribution planning,demand robust strategies for discovering effective solutions.This work presents the improved variant of the Multi-population Cooperative Constrained Multi-Objective Optimization(MCCMO)Algorithm,termed Adaptive Diversity Preservation(ADP).This enhancement is primarily focused on the improvement of constraint handling strategies,local search integration,hybrid selection approaches,and adaptive parameter control.Theimproved variant was experimented on with the RWMOP50 power distribution systemplanning benchmark.As per the findings,the improved variant outperformed the original MCCMO across the eleven performance metrics,particularly in terms of convergence speed,constraint handling efficiency,and solution diversity.The results also establish that MCCMOADP consistently delivers substantial performance gains over the baseline MCCMO,demonstrating its effectiveness across performancemetrics.The new variant also excels atmaintaining the balanced trade-off between exploration and exploitation throughout the search process,making it especially suitable for complex optimization problems in multiconstrained power systems.These enhancements make MCCMO-ADP a valuable and promising candidate for handling problems such as renewable energy scheduling,logistics planning,and power system optimization.Future work will benchmark the MCCMO-ADP against widely recognized algorithms such as NSGA-Ⅱ,NSGA-Ⅲ,and MOEA/D and will also extend its validation to large-scale real-world optimization domains to further consolidate its generalizability.展开更多
Deadlock resolution strategies based on siphon control are widely investigated.Their computational efficiency largely depends on siphon computation.Mixed-integer programming(MIP)can be utilized for the computation of ...Deadlock resolution strategies based on siphon control are widely investigated.Their computational efficiency largely depends on siphon computation.Mixed-integer programming(MIP)can be utilized for the computation of an emptiable siphon in a Petri net(PN).Based on it,deadlock resolution strategies can be designed without requiring complete siphon enumeration that has exponential complexity.Due to this reason,various MIP methods are proposed for various subclasses of PNs.This work proposes an innovative MIP method to compute an emptiable minimal siphon(EMS)for a subclass of PNs named S^(4)PR.In particular,many particular structural characteristics of EMS in S4 PR are formalized as constraints,which greatly reduces the solution space.Experimental results show that the proposed MIP method has higher computational efficiency.Furthermore,the proposed method allows one to determine the liveness of an ordinary S^(4)PR.展开更多
To properly describe and solve complex decision problems,research on theoretical properties and solution of mixed-integer quadratic programs is becoming very important.We establish in this paper different Lipschitz-ty...To properly describe and solve complex decision problems,research on theoretical properties and solution of mixed-integer quadratic programs is becoming very important.We establish in this paper different Lipschitz-type continuity results about the optimal value function and optimal solutions of mixed-integer parametric quadratic programs with parameters in the linear part of the objective function and in the right-hand sides of the linear constraints.The obtained results extend some existing results for continuous quadratic programs,and,more importantly,lay the foundation for further theoretical study and corresponding algorithm analysis on mixed-integer quadratic programs.展开更多
The Orlicz Minkowski problem for logarithmic capacity seeks to determine the necessary and sufficient conditions for a given finite Borel measure,such that it is the Orlicz logarithmic capacitary measure of a convex b...The Orlicz Minkowski problem for logarithmic capacity seeks to determine the necessary and sufficient conditions for a given finite Borel measure,such that it is the Orlicz logarithmic capacitary measure of a convex body.The Orlicz Minkowski problem for loga-rithmic capacity includes the Minkowski problem for logarithmic capacity and the Lp Minkowski problem for logarithmic capacity as special cases.The discrete case has been solved by the researchers.In this paper,we solve the Orlicz Minkowski problem for logarithmic capacity with respect to general Borel measures by applying an approximation scheme.展开更多
Background:Parenting exerts a profound influence on children’s mental health and behavioral development.Despite the high prevalence of children’s emotional and behavioral problems(CEBP)in China,evidence-based parent...Background:Parenting exerts a profound influence on children’s mental health and behavioral development.Despite the high prevalence of children’s emotional and behavioral problems(CEBP)in China,evidence-based parenting interventions remain scarcely investigated as preventive public health strategies.This pilot study evaluated a school-based intervention for preventing CEBP.Methods:We employed a quasi-experimental design with propensity score matching(PSM)to select 28 families(intervention:n=13;control:n=15)from two matched urban primary schools.Quantitative data from seven validated scales were analyzed using t-tests and ANCOVA.Qualitative insights were derived from 10 semi-structured interviews via thematic analysis.Results:Compared to the control group,the intervention group demonstrated significantly greater improvements in CEBP(p=0.020,Cohen’s d=0.92),parental adjustment(p=0.031,Cohen’s d=0.80),parenting confidence(p=0.003,Cohen’s d=1.04),and parentchild relationships(p=0.001,Cohen’s d=1.46).Non-significant effects were observed for parenting style,parental relationship,and parenting conflict(p>0.05).Qualitative analysis corroborated these findings and further identified contributing factors for non-significant outcomes,including challengeswithmeasurement adaptability and inconsistent co-parenting practices.Conclusions:This pilot study suggests that an authoritative parenting style may be effective and culturally adaptable in China.Positive parenting interventions appear to mitigate CEBP by reducing risk factors and enhancing protective factors.However,improving parental relationships and parenting conflict may require targeted strategies.Given the pilot nature of this PSM-matched study(n=28),the findings should be interpreted as exploratory and used primarily for intervention refinement.展开更多
基金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.
基金supported by the National Natural Science Fundation of China (60374063)
文摘Two classes of mixed-integer nonlinear bilevel programming problems are discussed. One is that the follower＇s functions are separable with respect to the follower＇s variables, and the other is that the follower＇s functions are convex if the follower＇s variables are not restricted to integers. A genetic algorithm based on an exponential distribution is proposed for the aforementioned problems. First, for each fixed leader＇s variable x, it is proved that the optimal solution y of the follower＇s mixed-integer programming can be obtained by solving associated relaxed problems, and according to the convexity of the functions involved, a simplified branch and bound approach is given to solve the follower＇s programming for the second class of problems. Furthermore, based on an exponential distribution with a parameter λ, a new crossover operator is designed in which the best individuals are used to generate better offspring of crossover. The simulation results illustrate that the proposed algorithm is efficient and robust.
基金the National Natural Science Foundation of China(No.61573378)the BUPT Excellent Ph.D.Students Foundation(No.CX2019113)。
文摘It is extremely challenging to solve the mixed-integer optimal control problems(MIOCPs)due to the complex computation in solving the integer decision variables.This paper presents a new method based on quantum annealing(QA)to solve MIOCP.The QA is a metaheuristic which applies quantum tunneling in the annealing process.It has a faster convergence speed in optimal-searching and is less likely to run into local minima.Hence,QA is applied to deal with this kind of optimization problems.First,MIOCP is transformed into a mixed-integer nonlinear programming(MINLP).Then,a method based on QA is adopted to solve the MINLP and acquire the optimal solution.At last,two benchmark examples including Lotka-Volterra type fishing problem and distillation column are presented and solved.The effectiveness of the metliodology is verified by the acquired optimal schemes.
基金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.
基金Supported by the National Natural Science Foundation of China(61871204,62174033)the Natural Science Foundation of Fujian Province(2017J01767,2020J01843)+1 种基金the Program for New Century Excellent Talents in Fujian Province Universitythe Science and Technology Project of Minjiang University(MYK19017)。
文摘The double row layout problem(DRLP)is to assign facilities on two rows in parallel so that the total cost of material handling among facilities is minimized.Since it is vital to save cost and enhance productivity,the DRLP plays an important role in many application fields.Nevertheless,it is very hard to handle the DRLP because of its complex model.In this paper,we consider a new simplified model for the DRLP(SM-DRLP)and provide a mixed integer programming(MIP)formulation for it.The continuous decision variables of the DRLP are divided into two parts:start points of double rows and adjustable clearances between adjacent facilities.The former one is considered in the new simplified model for the DRLP with the purpose of maintaining solution quality,while the latter one is not taken into account with the purpose of reducing computational time.To evaluate its performance,our SM-DRLP is compared with the model of a general DRLP and the model of another simplified DRLP.The experimental results show the efficiency of our proposed model.
基金supported by the National Natural Science Foundation of China(No.62362006)Guangxi Science and Technology Project(Key Research&Development)(No.GuiKeAB24010343)+1 种基金Guangxi“Bagui Scholar”Teams for Innovation and Research,Innovation Project of Guangxi Graduate Education(No.YCSW2025193)Guangxi Collaborative Innovation Center of Multi-source Information Integration and Intelligent Processing.
文摘In educational settings,instructors often lead students through hands-on software projects,sometimes engaging two different schools or departments.How can such collaborations be made more efficient,and how can students truly experience the importance of teamwork and the impact of organizational structure on project complexity?To answer these questions,we introduce the requirement-driven organization structure(R-DOS)approach,which tightly couples software requirements with the actual development process.By extending problem-frames modeling and focusing on requirements,R-DOS allows educators and students to(1)diagnose structural flaws early,(2)prescribe role-level and communication fixes,and(3)observe-in real time-how poor structure can derail a project while good structure accelerates learning and delivery.
基金CAPES,CNPq,and FAPEMIG(Brazilian Agencies)for their financial support。
文摘Cubic-shaped magnetic particles subjected to a dimensionless uniaxial anisotropy(Q=0.1)aligned with one of the crystallographic axes provide an ideal system for investigating magnetic equilibrium states.In this system,three fundamental magnetization configurations are identified:(i)the flower state,(ii)the twisted flower state,and(iii)the vortex state.This problem corresponds to standard problem No.3 proposed by the NIST Micromagnetics Modeling Group,widely adopted as a benchmark for validating computational micromagnetics methods.In this work,we approach the problem using a computational method based on direct dipolar interactions,in contrast to conventional techniques that typically compute the demagnetizing field via finite difference-based fast Fourier transform(FFT)methods,tensor grid approaches,or finite element formulations.Our results are compared with established literature data,focusing on the dimensionless parameterλ=L/l_(ex),where L is the cube edge length and l_(ex)is the exchange length of the material.To analyze equilibrium state transitions,we systematically varied the size L as a function of the simulation cell number N and intercellular spacing a,determining the criticalλvalue associated with configuration changes.Our simulations reveal that the transition between the twisted flower and vortex states occurs atλ≈8.45,consistent with values reported in the literature,validating our code(Grupo de Física da Matéeria Condensada-UFJF),and shows that this standard problem can be resolved using only interaction dipolar of a direct way without the need for sophisticated additional calculations.
文摘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 Science Foundation of China(11601525)the Natural Science Foundation of Hunan Province(2024JJ5412),the Changsha Municipal Natural Science Foundation(kq2402193).
文摘In this paper,we study the nonlinear Riemann boundary value problem with square roots that is represented by a Cauchy-type integral with kernel density in variable exponent Lebesgue spaces.We discuss the odd-order zero-points distribution of the solutions and separate the single valued analytic branch of the solutions with square roots,then convert the problem to a Riemann boundary value problem in variable exponent Lebesgue spaces and discuss the singularity of solutions at individual zeros belonging to curve.We consider two types of cases those where the coefficient is Hölder and those where it is piecewise Hölder.Then we solve the Hilbert boundary value problem with square roots in variable exponent Lebesgue spaces.By discussing the distribution of the odd-order zero-points for solutions and the method of symmetric extension,we convert the Hilbert problem to a Riemann boundary value problem.The equivalence of the transformation is discussed.Finally,we get the solvable conditions and the direct expressions of the solutions in variable exponent Lebesgue spaces.
基金Supported by Natural Science Foundation of Henan Province(Grant Nos.232300421218 and 252300421483).
文摘The airplane refueling problem can be stated as follows.We are given n airplanes which can refuel one another during the flight.Each airplane has a reservoir volume wj(liters)and a consumption rate pj(liters per kilometer).As soon as one airplane runs out of fuel,it is dropping out of the flight.The problem asks for finding a refueling scheme such that the last plane in the air reach a maximal distance.An equivalent version is the n-vehicle exploration problem.The computational complexity of this non-linear combinatorial optimization problem is open so far.This paper employs the neighborhood exchange method of single-machine scheduling to study the precedence relations of jobs,so as to improve the necessary and sufficiency conditions of optimal solutions,and establish an efficient heuristic algorithm which is a generalization of several existing special algorithms.
基金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 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.
文摘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.
基金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)。
文摘Physics-informed neural networks(PINNs)have been shown as powerful tools for solving partial differential equations(PDEs)by embedding physical laws into the network training.Despite their remarkable results,complicated problems such as irregular boundary conditions(BCs)and discontinuous or high-frequency behaviors remain persistent challenges for PINNs.For these reasons,we propose a novel two-phase framework,where a neural network is first trained to represent shape functions that can capture the irregularity of BCs in the first phase,and then these neural network-based shape functions are used to construct boundary shape functions(BSFs)that exactly satisfy both essential and natural BCs in PINNs in the second phase.This scheme is integrated into both the strong-form and energy PINN approaches,thereby improving the quality of solution prediction in the cases of irregular BCs.In addition,this study examines the benefits and limitations of these approaches in handling discontinuous and high-frequency problems.Overall,our method offers a unified and flexible solution framework that addresses key limitations of existing PINN methods with higher accuracy and stability for general PDE problems in solid mechanics.
文摘The multi-objective optimization problems,especially in constrained environments such as power distribution planning,demand robust strategies for discovering effective solutions.This work presents the improved variant of the Multi-population Cooperative Constrained Multi-Objective Optimization(MCCMO)Algorithm,termed Adaptive Diversity Preservation(ADP).This enhancement is primarily focused on the improvement of constraint handling strategies,local search integration,hybrid selection approaches,and adaptive parameter control.Theimproved variant was experimented on with the RWMOP50 power distribution systemplanning benchmark.As per the findings,the improved variant outperformed the original MCCMO across the eleven performance metrics,particularly in terms of convergence speed,constraint handling efficiency,and solution diversity.The results also establish that MCCMOADP consistently delivers substantial performance gains over the baseline MCCMO,demonstrating its effectiveness across performancemetrics.The new variant also excels atmaintaining the balanced trade-off between exploration and exploitation throughout the search process,making it especially suitable for complex optimization problems in multiconstrained power systems.These enhancements make MCCMO-ADP a valuable and promising candidate for handling problems such as renewable energy scheduling,logistics planning,and power system optimization.Future work will benchmark the MCCMO-ADP against widely recognized algorithms such as NSGA-Ⅱ,NSGA-Ⅲ,and MOEA/D and will also extend its validation to large-scale real-world optimization domains to further consolidate its generalizability.
基金supported in part by Zhejiang Provincial Key Research and Development Program(2018C01084)Zhejiang Natural Science Foundation(LQ20F020009)Zhejiang Gongshang University,Zhejiang Provincial Key Laboratory of New Network Standards and Technologies(2013E10012)。
文摘Deadlock resolution strategies based on siphon control are widely investigated.Their computational efficiency largely depends on siphon computation.Mixed-integer programming(MIP)can be utilized for the computation of an emptiable siphon in a Petri net(PN).Based on it,deadlock resolution strategies can be designed without requiring complete siphon enumeration that has exponential complexity.Due to this reason,various MIP methods are proposed for various subclasses of PNs.This work proposes an innovative MIP method to compute an emptiable minimal siphon(EMS)for a subclass of PNs named S^(4)PR.In particular,many particular structural characteristics of EMS in S4 PR are formalized as constraints,which greatly reduces the solution space.Experimental results show that the proposed MIP method has higher computational efficiency.Furthermore,the proposed method allows one to determine the liveness of an ordinary S^(4)PR.
基金Supported by the National Natural Science Foundation of China(10571141,70971109)the Key Projectof the National Natural Science Foundation of China(70531030)
文摘To properly describe and solve complex decision problems,research on theoretical properties and solution of mixed-integer quadratic programs is becoming very important.We establish in this paper different Lipschitz-type continuity results about the optimal value function and optimal solutions of mixed-integer parametric quadratic programs with parameters in the linear part of the objective function and in the right-hand sides of the linear constraints.The obtained results extend some existing results for continuous quadratic programs,and,more importantly,lay the foundation for further theoretical study and corresponding algorithm analysis on mixed-integer quadratic programs.
基金Supported by Postgraduate Scientific Research Innovation Project of Hunan Province(CX20231033)Science and Technology Research Project of Jiangxi Provincial Education Department(GJJ210815)+2 种基金Jiangxi Provincial Natural Science Foundation(20232BAB201005)the National Natural Science Founda-tion of China(12461010,12161043)the Scientific Research Fund of Hunan Provincial Education Department(24A0338)。
文摘The Orlicz Minkowski problem for logarithmic capacity seeks to determine the necessary and sufficient conditions for a given finite Borel measure,such that it is the Orlicz logarithmic capacitary measure of a convex body.The Orlicz Minkowski problem for loga-rithmic capacity includes the Minkowski problem for logarithmic capacity and the Lp Minkowski problem for logarithmic capacity as special cases.The discrete case has been solved by the researchers.In this paper,we solve the Orlicz Minkowski problem for logarithmic capacity with respect to general Borel measures by applying an approximation scheme.
基金supported by the National Social Science Fund of China[18BSH146].
文摘Background:Parenting exerts a profound influence on children’s mental health and behavioral development.Despite the high prevalence of children’s emotional and behavioral problems(CEBP)in China,evidence-based parenting interventions remain scarcely investigated as preventive public health strategies.This pilot study evaluated a school-based intervention for preventing CEBP.Methods:We employed a quasi-experimental design with propensity score matching(PSM)to select 28 families(intervention:n=13;control:n=15)from two matched urban primary schools.Quantitative data from seven validated scales were analyzed using t-tests and ANCOVA.Qualitative insights were derived from 10 semi-structured interviews via thematic analysis.Results:Compared to the control group,the intervention group demonstrated significantly greater improvements in CEBP(p=0.020,Cohen’s d=0.92),parental adjustment(p=0.031,Cohen’s d=0.80),parenting confidence(p=0.003,Cohen’s d=1.04),and parentchild relationships(p=0.001,Cohen’s d=1.46).Non-significant effects were observed for parenting style,parental relationship,and parenting conflict(p>0.05).Qualitative analysis corroborated these findings and further identified contributing factors for non-significant outcomes,including challengeswithmeasurement adaptability and inconsistent co-parenting practices.Conclusions:This pilot study suggests that an authoritative parenting style may be effective and culturally adaptable in China.Positive parenting interventions appear to mitigate CEBP by reducing risk factors and enhancing protective factors.However,improving parental relationships and parenting conflict may require targeted strategies.Given the pilot nature of this PSM-matched study(n=28),the findings should be interpreted as exploratory and used primarily for intervention refinement.
