Let K_(j)/Q,1≤j≤ν,ν≥2 be quadratic fields with pairwise coprime discriminants Dj,and let τ_(kj)^(K_(j))(n)be the divisor function associated to Dedekind zeta function SK_(j)(s).In this paper,we consider a multid...Let K_(j)/Q,1≤j≤ν,ν≥2 be quadratic fields with pairwise coprime discriminants Dj,and let τ_(kj)^(K_(j))(n)be the divisor function associated to Dedekind zeta function SK_(j)(s).In this paper,we consider a multidimensional general divisor problem related to the τ_(kj)^(K_(j))(n)involving several number fields over square integers,by establishing the corresponding asymptotic formula.As an application,we also obtain the asymptotic formula of variance of these coefi icients.展开更多
This paper is concerned with a class of nonlinear fractional differential equations with a disturbance parameter in the integral boundary conditions on the infinite interval.By using Guo-Krasnoselskii fixed point theo...This paper is concerned with a class of nonlinear fractional differential equations with a disturbance parameter in the integral boundary conditions on the infinite interval.By using Guo-Krasnoselskii fixed point theorem,fixed point index theory and the analytic technique,we give the bifurcation point of the parameter which divides the range of parameter for the existence of at least two,one and no positive solutions for the problem.And,by using a fixed point theorem of generalized concave operator and cone theory,we establish the maximum parameter interval for the existence of the unique positive solution for the problem and show that such a positive solution continuously depends on the parameter.In the end,some examples are given to illustrate our main results.展开更多
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.展开更多
This paper is concerned with the following nonlinear Steklov problemΔu=0 in D,∂vu=λf(u)on∂D,where D is the unit disk in the plane,∂v denotes the unit outward normal derivative.For each k∈N,under some natural condit...This paper is concerned with the following nonlinear Steklov problemΔu=0 in D,∂vu=λf(u)on∂D,where D is the unit disk in the plane,∂v denotes the unit outward normal derivative.For each k∈N,under some natural conditions on f,using the Crandall-Rabinowitz bifurcation theorem,we obtain a bifurcation curve emanating from(k,0).Furthermore,we also analyze the local structure of bifurcation curves and stability of solutions on them.Specifically,our results indicate the bifurcation is critical for each k and is subcritical(supercritical)if f'''(0)>0(f'''(0)<0).展开更多
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.展开更多
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.展开更多
Sensitivity of observational data is important in the study of Glacial Isostatic Adjustment(GIA).However,depending on whether sensitivity is used for the Inverse Problem or the Forward Problem,the final formulation an...Sensitivity of observational data is important in the study of Glacial Isostatic Adjustment(GIA).However,depending on whether sensitivity is used for the Inverse Problem or the Forward Problem,the final formulation and display of the sensitivity kernel will be different.Unfortunately,in the past,both perspectives give the same name to their quantity computed/displayed,and that has caused some confusion.To distinguish between the two,their perspective should be added to the names.This paper focuses only on the perspective of the Forward Problem where the input parameters are known.The Perturbation method has been successfully used in the computation of the sensitivity kernels of observations on 1D and 3D viscosity variations from the Forward perspective.One aim of this paper is to review and clarify the physics of the Perturbation method and bring out some important aspects of this method that have been misunderstood or neglected.Another aim is to present sensitivity kernels from the Perturbation method using 3D(both radially and laterally heterogeneous)Earth models with realistic ice history.These new results are now suitable for future comparison with those from new methods using the Forward perspective.Finally,the sensitivity computations for realistic ice histories on a 3D Earth is reviewed and used to search for optimal locations of new GIA observations.展开更多
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.展开更多
Recently,the zeroing neural network(ZNN)has demonstrated remarkable effectiveness in tackling time-varying problems,delivering robust performance across both noise-free and noisy environments.However,existing ZNN mode...Recently,the zeroing neural network(ZNN)has demonstrated remarkable effectiveness in tackling time-varying problems,delivering robust performance across both noise-free and noisy environments.However,existing ZNN models are limited in their ability to actively suppress noise,which constrains their robustness and precision in solving time-varying problems.This paper introduces a novel active noise rejection ZNN(ANR-ZNN)design that enhances noise suppression by integrating computational error dynamics and harmonic behaviour.Through rigorous theoretical analysis,we demonstrate that the proposed ANR-ZNN maintains robust convergence in computational error performance under environmental noise.As a case study,the ANR-ZNN model is specifically applied to time-varying matrix inversion.Comprehensive computer simulations and robotic experiments further validate the ANR-ZNN's effectiveness,emphasising the proposed design's superiority and potential for solving time-varying problems.展开更多
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.展开更多
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.展开更多
基金Supported in part by NSFC(Nos.12401011,12201214)National Key Research and Development Program of China(No.2021YFA1000700)+3 种基金Shaanxi Fundamental Science Research Project for Mathematics and Physics(No.23JSQ053)Science and Technology Program for Youth New Star of Shaanxi Province(No.2025ZC-KJXX-29)Natural Science Basic Research Program of Shaanxi Province(No.2025JC-YBQN-091)Scientific Research Foundation for Young Talents of WNU(No.2024XJ-QNRC-01)。
文摘Let K_(j)/Q,1≤j≤ν,ν≥2 be quadratic fields with pairwise coprime discriminants Dj,and let τ_(kj)^(K_(j))(n)be the divisor function associated to Dedekind zeta function SK_(j)(s).In this paper,we consider a multidimensional general divisor problem related to the τ_(kj)^(K_(j))(n)involving several number fields over square integers,by establishing the corresponding asymptotic formula.As an application,we also obtain the asymptotic formula of variance of these coefi icients.
基金Supported by the National Natural Science Foundation of China(11361047)Fundamental Research Program of Shanxi Province(20210302124529)。
文摘This paper is concerned with a class of nonlinear fractional differential equations with a disturbance parameter in the integral boundary conditions on the infinite interval.By using Guo-Krasnoselskii fixed point theorem,fixed point index theory and the analytic technique,we give the bifurcation point of the parameter which divides the range of parameter for the existence of at least two,one and no positive solutions for the problem.And,by using a fixed point theorem of generalized concave operator and cone theory,we establish the maximum parameter interval for the existence of the unique positive solution for the problem and show that such a positive solution continuously depends on the parameter.In the end,some examples are given to illustrate our main results.
基金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(Grant No.12371110).
文摘This paper is concerned with the following nonlinear Steklov problemΔu=0 in D,∂vu=λf(u)on∂D,where D is the unit disk in the plane,∂v denotes the unit outward normal derivative.For each k∈N,under some natural conditions on f,using the Crandall-Rabinowitz bifurcation theorem,we obtain a bifurcation curve emanating from(k,0).Furthermore,we also analyze the local structure of bifurcation curves and stability of solutions on them.Specifically,our results indicate the bifurcation is critical for each k and is subcritical(supercritical)if f'''(0)>0(f'''(0)<0).
基金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.
文摘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.
文摘Sensitivity of observational data is important in the study of Glacial Isostatic Adjustment(GIA).However,depending on whether sensitivity is used for the Inverse Problem or the Forward Problem,the final formulation and display of the sensitivity kernel will be different.Unfortunately,in the past,both perspectives give the same name to their quantity computed/displayed,and that has caused some confusion.To distinguish between the two,their perspective should be added to the names.This paper focuses only on the perspective of the Forward Problem where the input parameters are known.The Perturbation method has been successfully used in the computation of the sensitivity kernels of observations on 1D and 3D viscosity variations from the Forward perspective.One aim of this paper is to review and clarify the physics of the Perturbation method and bring out some important aspects of this method that have been misunderstood or neglected.Another aim is to present sensitivity kernels from the Perturbation method using 3D(both radially and laterally heterogeneous)Earth models with realistic ice history.These new results are now suitable for future comparison with those from new methods using the Forward perspective.Finally,the sensitivity computations for realistic ice histories on a 3D Earth is reviewed and used to search for optimal locations of new GIA observations.
基金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 National Science and Technology Major Project(2022ZD0119901)the National Natural Science Foundation of China under Grant(U2141234,62463004 and U24A20260)+1 种基金the Hainan Province Science and Technology Special Fund(ZDYF2024GXJS003)the Scientific Research Fund of Hainan University(KYQD(ZR)23025).
文摘Recently,the zeroing neural network(ZNN)has demonstrated remarkable effectiveness in tackling time-varying problems,delivering robust performance across both noise-free and noisy environments.However,existing ZNN models are limited in their ability to actively suppress noise,which constrains their robustness and precision in solving time-varying problems.This paper introduces a novel active noise rejection ZNN(ANR-ZNN)design that enhances noise suppression by integrating computational error dynamics and harmonic behaviour.Through rigorous theoretical analysis,we demonstrate that the proposed ANR-ZNN maintains robust convergence in computational error performance under environmental noise.As a case study,the ANR-ZNN model is specifically applied to time-varying matrix inversion.Comprehensive computer simulations and robotic experiments further validate the ANR-ZNN's effectiveness,emphasising the proposed design's superiority and potential for solving time-varying problems.
基金Supported by the Natural Science Foundation of Guangxi Province(Grant Nos.2023GXNSFAA026067,2024GXN SFAA010521)the National Natural Science Foundation of China(Nos.12361079,12201149,12261026).
文摘Convex feasibility problems are widely used in image reconstruction, sparse signal recovery, and other areas. This paper is devoted to considering a class of convex feasibility problem arising from sparse signal recovery. We first derive the projection formulas for a vector onto the feasible sets. The centralized circumcentered-reflection method is designed to solve the convex feasibility problem. Some numerical experiments demonstrate the feasibility and effectiveness of the proposed algorithm, showing superior performance compared to conventional alternating projection methods.
基金supported by the National 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.
