This paper investigates the following mixed local and nonlocal elliptic problem fea-turing concave-convex nonlinearities and a discontinuous right-hand side:{L(u)=H(u−μ)|u|^(p−2)u+λ|u|^(q−2)u,x∈Ω,u≥0,x∈Ω,u=0,x...This paper investigates the following mixed local and nonlocal elliptic problem fea-turing concave-convex nonlinearities and a discontinuous right-hand side:{L(u)=H(u−μ)|u|^(p−2)u+λ|u|^(q−2)u,x∈Ω,u≥0,x∈Ω,u=0,x∈R^(N)\Ω,where Ω ⊂R^(N)(N>2)is a bounded domain,μ≥0 and λ>0 are real parameters,H denotes the Heaviside function(H(t)=0 for t<0,H(t)=1 for t>0),and the mixed local and nolocal operator is defined as L(u)=−Δu+(−Δ)^(s)u with(−Δ)^(s) being the restricted fractional Laplace(0<s<1).The exponents satisfy 1<q<2<p.By employing a novel non-smooth variational principle,we establish the existence of an M-solution for this problem and identify a range for the exponent p.展开更多
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.展开更多
In this paper,a composite numerical scheme is proposed to solve the threedimensional Darcy-Forchheimer miscible displacement problem with positive semi-definite assumptions.A mixed finite element is used for the fow e...In this paper,a composite numerical scheme is proposed to solve the threedimensional Darcy-Forchheimer miscible displacement problem with positive semi-definite assumptions.A mixed finite element is used for the fow equation.The velocity and pressure are computed simultaneously.The accuracy of velocity is improved one order.The concentration equation is solved by using mixed finite element,multi-step difference and upwind approximation.A multi-step method is used to approximate time derivative for improving the accuracy.The upwind approximation and an expanded mixed finite element are adopted to solve the convection and diffusion,respectively.The composite method could compute the diffusion flux and its gradient.It possibly becomes an eficient tool for solving convection-dominated diffusion problems.Firstly,the conservation of mass holds.Secondly,the multi-step method has high accuracy.Thirdly,the upwind approximation could avoid numerical dispersion.Using numerical analysis of a priori estimates and special techniques of differential equations,we give an error estimates for a positive definite problem.Numerical experiments illustrate its computational efficiency and feasibility of application.展开更多
Satellite Component Layout Optimization(SCLO) is crucial in satellite system design.This paper proposes a novel Satellite Three-Dimensional Component Assignment and Layout Optimization(3D-SCALO) problem tailored to en...Satellite Component Layout Optimization(SCLO) is crucial in satellite system design.This paper proposes a novel Satellite Three-Dimensional Component Assignment and Layout Optimization(3D-SCALO) problem tailored to engineering requirements, aiming to optimize satellite heat dissipation while considering constraints on static stability, 3D geometric relationships between components, and special component positions. The 3D-SCALO problem is a challenging bilevel combinatorial optimization task, involving the optimization of discrete component assignment variables in the outer layer and continuous component position variables in the inner layer,with both influencing each other. To address this issue, first, a Mixed Integer Programming(MIP) model is proposed, which reformulates the original bilevel problem into a single-level optimization problem, enabling the exploration of a more comprehensive optimization space while avoiding iterative nested optimization. Then, to model the 3D geometric relationships between components within the MIP framework, a linearized 3D Phi-function method is proposed, which handles non-overlapping and safety distance constraints between cuboid components in an explicit and effective way. Subsequently, the Finite-Rectangle Method(FRM) is proposed to manage 3D geometric constraints for complex-shaped components by approximating them with a finite set of cuboids, extending the applicability of the geometric modeling approach. Finally, the feasibility and effectiveness of the proposed MIP model are demonstrated through two numerical examples"and a real-world engineering case, which confirms its suitability for complex-shaped components and real engineering applications.展开更多
In this article,we conduct a study on mixed quasi-martingale Hardy spaces that are defined by means of the mixed L_(p)-norm.By utilizing Doob’s inequalities,we explore the atomic decomposition and quasi-martingale in...In this article,we conduct a study on mixed quasi-martingale Hardy spaces that are defined by means of the mixed L_(p)-norm.By utilizing Doob’s inequalities,we explore the atomic decomposition and quasi-martingale inequalities of mixed quasi-martingale Hardy spaces.Moreover,we furnish sufficient conditions for the boundedness ofσ-sublinear operators in these spaces.These findings extend the existing conclusions regarding mixed quasi-martingale Hardy spaces defined with the help of the mixed L_(p)-norm.展开更多
Objectives This review aimed to systematically synthesize the available research on the disclosure of diagnosis and related issues in childhood cancer from the perspectives of healthcare professionals,with the goal of...Objectives This review aimed to systematically synthesize the available research on the disclosure of diagnosis and related issues in childhood cancer from the perspectives of healthcare professionals,with the goal of informing the optimization of disclosure processes and meeting the communication needs of affected families.Methods In accordance with the Joanna Briggs Institute(JBI)methodology for mixed methods systematic reviews,the convergent segregated approach was used in this review.Articles were retrieved from 11 databases,including PubMed,Web of Science,CINAHL,CENTRAL,Embase,Ovid/Medline,PsycINFO,PsycArticles,Scopus,ERIC,and China National Knowledge Infrastructure(CNKI).The quality of the selected articles was assessed using the Mixed Method Appraisal Tool(MMAT).The review protocol was registered on PROSPERO(CRD42024542746).Results A total of 21 studies from 10 countries were included.Their methodological quality was generally medium to high,with MMAT scores ranging from 60%to 100%.The synthesis yielded three core themes:1)the spectrum of professional and societal attitudes toward disclosure;2)the dynamic practices of navigating disclosure amid uncertainty,including timing and environment,stakeholders,and content of disclosure;and 3)factors influencing disclosure,including children’s,parental,healthcare professionals’,and socio-cultural factors.Conclusions This review synthesized the perspectives and experiences of healthcare professionals regarding disclosure in childhood cancer,highlighting the complexity and multidimensional nature of this process in clinical practice.Future research should further investigate the experiences and needs of children and their parents,explore cultural variations in disclosure practices,develop context-appropriate assessment tools,and construct multidimensional intervention strategies to enhance the humanistic care and professional effectiveness of the disclosure process.展开更多
Generalised reduced masses with a set of equations governing the three relative motions between two of 3-bodies in their gravitational field are established,of which the dynamic characteristics of 3-body dynamics,fund...Generalised reduced masses with a set of equations governing the three relative motions between two of 3-bodies in their gravitational field are established,of which the dynamic characteristics of 3-body dynamics,fundamental bases of this paper,are revealed.Based on these findings,an equivalent system is developed,which is a 2-body system with its total mass,constant angular momentum,kinetic and potential energies same as the total ones of three relative motions,so that it can be solved using the well-known theory of the 2-body system.From the solution of an equivalent system with the revealed characteristics of three relative motions,the general theoretical solutions of the 3-body system are obtained in the curve-integration forms along the orbits in the imaged radial motion space.The possible periodical orbits with generalised Kepler’s law are presented.Following the description and mathematical demonstrations of the proposed methods,the examples including Euler’s/Lagrange’s problems,and a reported numerical one are solved to validate the proposed methods.The methods derived from the 3-body system are extended to N-body problems.展开更多
The advantages of genome selection(GS) in animal and plant breeding are self-evident.Traditional parametric models have disadvantage in better fit the increasingly large sequencing data and capture complex effects acc...The advantages of genome selection(GS) in animal and plant breeding are self-evident.Traditional parametric models have disadvantage in better fit the increasingly large sequencing data and capture complex effects accurately.Machine learning models have demonstrated remarkable potential in addressing these challenges.In this study,we introduced the concept of mixed kernel functions to explore the performance of support vector machine regression(SVR) in GS.Six single kernel functions(SVR_L,SVR_C,SVR_G,SVR_P,SVR_S,SVR_L) and four mixed kernel functions(SVR_GS,SVR_GP,SVR_LS,SVR_LP) were used to predict genome breeding values.The prediction accuracy,mean squared error(MSE) and mean absolute error(MAE) were used as evaluation indicators to compare with two traditional parametric models(GBLUP,BayesB) and two popular machine learning models(RF,KcRR).The results indicate that in most cases,the performance of the mixed kernel function model significantly outperforms that of GBLUP,BayesB and single kernel function.For instance,for T1 in the pig dataset,the predictive accuracy of SVR_GS is improved by 10% compared to GBLUP,and by approximately 4.4 and 18.6% compared to SVR_G and SVR_S respectively.For E1 in the wheat dataset,SVR_GS achieves 13.3% higher prediction accuracy than GBLUP.Among single kernel functions,the Laplacian and Gaussian kernel functions yield similar results,with the Gaussian kernel function performing better.The mixed kernel function notably reduces the MSE and MAE when compared to all single kernel functions.Furthermore,regarding runtime,SVR_GS and SVR_GP mixed kernel functions run approximately three times faster than GBLUP in the pig dataset,with only a slight increase in runtime compared to the single kernel function model.In summary,the mixed kernel function model of SVR demonstrates speed and accuracy competitiveness,and the model such as SVR_GS has important application potential for GS.展开更多
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.展开更多
Pesticide poisoning remains a critical public health challenge worldwide.At present,chlorfenapyr,classifi ed by the World Health Organization(WHO)as a moderately toxic insecticide,is increasingly used in agriculture,l...Pesticide poisoning remains a critical public health challenge worldwide.At present,chlorfenapyr,classifi ed by the World Health Organization(WHO)as a moderately toxic insecticide,is increasingly used in agriculture,leading to more poisoning incidents.It has a fatality rate as high as 76%after poisoning.[1]Here,we report a successful treatment of a patient with mixed pesticide poisoning caused by lethaldose emamectin benzoate(EB)and chlorfenapyr in the Department of Critical Care Medicine,Yangzhou Hongquan Hospital.展开更多
An optimal dimension-down iterative algorithm （DDIA） is proposed for solving a mixed （continuous/ discrete） transportation network design problem （MNDP）, which is generally expressed as a mathematical programmin...An optimal dimension-down iterative algorithm （DDIA） is proposed for solving a mixed （continuous/ discrete） transportation network design problem （MNDP）, which is generally expressed as a mathematical programming with equilibrium constraints （MPEC）. The upper level of the MNDP aims to optimize the network performance via both the expansion of existing links and the addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium （UE） model. The idea of the proposed DDIA is to reduce the dimensions of the problem. A group of variables （discrete/continuous） are fixed to altemately optimize another group of variables （continuous/discrete）. Some continuous network design problems （CNDPs） and discrete network design problems （DNDPs） are solved repeatedly until the optimal solution is obtained. A numerical example is given to demonstrate the efficiency of the proposed algorithm.展开更多
A novel chaotic search method is proposed,and a hybrid algorithm combining particle swarm optimization(PSO) with this new method,called CLSPSO,is put forward to solve 14 integer and mixed integer programming problems....A novel chaotic search method is proposed,and a hybrid algorithm combining particle swarm optimization(PSO) with this new method,called CLSPSO,is put forward to solve 14 integer and mixed integer programming problems.The performances of CLSPSO are compared with those of other five hybrid algorithms combining PSO with chaotic search methods.Experimental results indicate that in terms of robustness and final convergence speed,CLSPSO is better than other five algorithms in solving many of these problems.Furthermore,CLSPSO exhibits good performance in solving two high-dimensional problems,and it finds better solutions than the known ones.A performance index(PI) is introduced to fairly compare the above six algorithms,and the obtained values of(PI) in three cases demonstrate that CLSPSO is superior to all the other five algorithms under the same conditions.展开更多
This paper uses a hybrid algorithm to find a common element of the set of solutions to a generalized mixed equilibrium problem, the set of solutions to variational inequality problems, and the set of common fixed poin...This paper uses a hybrid algorithm to find a common element of the set of solutions to a generalized mixed equilibrium problem, the set of solutions to variational inequality problems, and the set of common fixed points for a finite family of quasi-C- nonexpansive mappings in a uniformly smooth and strictly convex Banach space. As applications, we utilize our results to study the optimization problem. It shows that our results improve and extend the corresponding results announced by many others recently.展开更多
A new class of bilcvel generalized mixed equilibrium problems involving setvalued mappings is introduced and studied in a real Banach space. By using the auxiliary principle technique, new iterative algorithms for sol...A new class of bilcvel generalized mixed equilibrium problems involving setvalued mappings is introduced and studied in a real Banach space. By using the auxiliary principle technique, new iterative algorithms for solving the generalized mixed equilibrium problems and bilevel generalized mixed equilibrium problems involving set-valued mappings are suggested and analyzed. Existence of solutions and strong convergence of the iterative sequences generated by the algorithms are proved under quite mild conditions. The behavior of the solution set of the generalized mixed equilibrium problems and bilevel generalized mixed equilibrium problems is also discussed. These results are new and generalize some recent results in this field.展开更多
Without applying any stable element techniques in the mixed methods, two simple generalized mixed element(GME) formulations were derived by combining the minimum potential energy principle and Hellinger–Reissner(H–R...Without applying any stable element techniques in the mixed methods, two simple generalized mixed element(GME) formulations were derived by combining the minimum potential energy principle and Hellinger–Reissner(H–R) variational principle. The main features of the GME formulations are that the common C0-continuous polynomial shape functions for displacement methods are used to express both displacement and stress variables, and the coefficient matrix of these formulations is not only automatically symmetric but also invertible. Hence, the numerical results of the generalized mixed methods based on the GME formulations are stable. Displacement as well as stress results can be obtained directly from the algebraic system for finite element analysis after introducing stress and displacement boundary conditions simultaneously. Numerical examples show that displacement and stress results retain the same accuracy. The results of the noncompatible generalized mixed method proposed herein are more accurate than those of the standard noncompatible displacement method. The noncompatible generalized mixed element is less sensitive to element geometric distortions.展开更多
The analytical continuation method is adopted to solve a mixed electric boundary value problem for a piezoelectric medium under anti-plane deformation.The crack face is partly conductive and partly impermeable.The res...The analytical continuation method is adopted to solve a mixed electric boundary value problem for a piezoelectric medium under anti-plane deformation.The crack face is partly conductive and partly impermeable.The results show that the stress intensity factor is identical with the mode Ⅲ stress intensity factor independent of the conducting length.But the electric field and the electric displacement are dependent on the electric boundary conditions on the crack faces and are singular not only at the crack tips but also at the junctures between the impermeable part and conducting portions.展开更多
In this paper,the mixed initial-boundary value problem for general first order quasi-linear hyperbolic systems with nonlinear boundary conditions in the domain D={(t,x)|t≥0,x≥0}is considered.A sufficient condition t...In this paper,the mixed initial-boundary value problem for general first order quasi-linear hyperbolic systems with nonlinear boundary conditions in the domain D={(t,x)|t≥0,x≥0}is considered.A sufficient condition to guarantee the existence and uniqueness of global weakly discontinuous solution is given.展开更多
Mixed-face ground encountered in Tunnel Boring Machine(TBM) tunneling presents great challenges and may trigger potential hazards without warning. A detailed understanding of such unfavorable conditions is therefore c...Mixed-face ground encountered in Tunnel Boring Machine(TBM) tunneling presents great challenges and may trigger potential hazards without warning. A detailed understanding of such unfavorable conditions is therefore critical to a successful bored tunnel. In this paper, we firstly present a brief review of the definition, classification and the factors related to mixed-face conditions. Secondly, for a better understanding of this topic, we investigate the main difficulties and problems involved in TBM tunnelling under mixed-face ground with detailed cases. Thirdly, from the viewpoint of rock-machine interaction, we give some suggestions on the corresponding mitigation measurements from three categories:(i) selection of TBM type and modification of TBM,(ii) condition of ground and(iii) optimization of TBM operation.展开更多
The method in [1] has been extended to the case of rotational flow in this paper. A new method for dealing with the shock wave is presented. This method has the advantages of both the shock-fitting and the shock captu...The method in [1] has been extended to the case of rotational flow in this paper. A new method for dealing with the shock wave is presented. This method has the advantages of both the shock-fitting and the shock capturing methods. The direct problem and the mixed direct-inverse prob- lem of the rotational flow in a transonic plane cascade at both design and off design conditions are solved, and the results show that the present method has rapid convergence rate and high accuracy even for the flow with moderately strong shocks. The calculations have been carried out on the DPS-8 computer, and for the direct problem, only 50-80 iterations are needed, and 50-80 seconds of CPU time are required.展开更多
基金Supported by the National Natural Science Foundation of China(Grant No.12361026)the Discipline Construction Fund Project of Northwest Minzu University.
文摘This paper investigates the following mixed local and nonlocal elliptic problem fea-turing concave-convex nonlinearities and a discontinuous right-hand side:{L(u)=H(u−μ)|u|^(p−2)u+λ|u|^(q−2)u,x∈Ω,u≥0,x∈Ω,u=0,x∈R^(N)\Ω,where Ω ⊂R^(N)(N>2)is a bounded domain,μ≥0 and λ>0 are real parameters,H denotes the Heaviside function(H(t)=0 for t<0,H(t)=1 for t>0),and the mixed local and nolocal operator is defined as L(u)=−Δu+(−Δ)^(s)u with(−Δ)^(s) being the restricted fractional Laplace(0<s<1).The exponents satisfy 1<q<2<p.By employing a novel non-smooth variational principle,we establish the existence of an M-solution for this problem and identify a range for the exponent p.
基金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 Natural Science Foundation of Shandong Province(ZR2021MA019)the National Natural Science Foundation of China(11871312)。
文摘In this paper,a composite numerical scheme is proposed to solve the threedimensional Darcy-Forchheimer miscible displacement problem with positive semi-definite assumptions.A mixed finite element is used for the fow equation.The velocity and pressure are computed simultaneously.The accuracy of velocity is improved one order.The concentration equation is solved by using mixed finite element,multi-step difference and upwind approximation.A multi-step method is used to approximate time derivative for improving the accuracy.The upwind approximation and an expanded mixed finite element are adopted to solve the convection and diffusion,respectively.The composite method could compute the diffusion flux and its gradient.It possibly becomes an eficient tool for solving convection-dominated diffusion problems.Firstly,the conservation of mass holds.Secondly,the multi-step method has high accuracy.Thirdly,the upwind approximation could avoid numerical dispersion.Using numerical analysis of a priori estimates and special techniques of differential equations,we give an error estimates for a positive definite problem.Numerical experiments illustrate its computational efficiency and feasibility of application.
基金supported by the National Natural Science Foundation of China(No.92371206)the Postgraduate Scientific Research Innovation Project of Hunan Province,China(No.CX2023063).
文摘Satellite Component Layout Optimization(SCLO) is crucial in satellite system design.This paper proposes a novel Satellite Three-Dimensional Component Assignment and Layout Optimization(3D-SCALO) problem tailored to engineering requirements, aiming to optimize satellite heat dissipation while considering constraints on static stability, 3D geometric relationships between components, and special component positions. The 3D-SCALO problem is a challenging bilevel combinatorial optimization task, involving the optimization of discrete component assignment variables in the outer layer and continuous component position variables in the inner layer,with both influencing each other. To address this issue, first, a Mixed Integer Programming(MIP) model is proposed, which reformulates the original bilevel problem into a single-level optimization problem, enabling the exploration of a more comprehensive optimization space while avoiding iterative nested optimization. Then, to model the 3D geometric relationships between components within the MIP framework, a linearized 3D Phi-function method is proposed, which handles non-overlapping and safety distance constraints between cuboid components in an explicit and effective way. Subsequently, the Finite-Rectangle Method(FRM) is proposed to manage 3D geometric constraints for complex-shaped components by approximating them with a finite set of cuboids, extending the applicability of the geometric modeling approach. Finally, the feasibility and effectiveness of the proposed MIP model are demonstrated through two numerical examples"and a real-world engineering case, which confirms its suitability for complex-shaped components and real engineering applications.
基金Supported by the National Natural Science Foundation of China(11871195)。
文摘In this article,we conduct a study on mixed quasi-martingale Hardy spaces that are defined by means of the mixed L_(p)-norm.By utilizing Doob’s inequalities,we explore the atomic decomposition and quasi-martingale inequalities of mixed quasi-martingale Hardy spaces.Moreover,we furnish sufficient conditions for the boundedness ofσ-sublinear operators in these spaces.These findings extend the existing conclusions regarding mixed quasi-martingale Hardy spaces defined with the help of the mixed L_(p)-norm.
基金supported by the Fuxing Nursing Research Foundation of Fudan University[FNF202352].
文摘Objectives This review aimed to systematically synthesize the available research on the disclosure of diagnosis and related issues in childhood cancer from the perspectives of healthcare professionals,with the goal of informing the optimization of disclosure processes and meeting the communication needs of affected families.Methods In accordance with the Joanna Briggs Institute(JBI)methodology for mixed methods systematic reviews,the convergent segregated approach was used in this review.Articles were retrieved from 11 databases,including PubMed,Web of Science,CINAHL,CENTRAL,Embase,Ovid/Medline,PsycINFO,PsycArticles,Scopus,ERIC,and China National Knowledge Infrastructure(CNKI).The quality of the selected articles was assessed using the Mixed Method Appraisal Tool(MMAT).The review protocol was registered on PROSPERO(CRD42024542746).Results A total of 21 studies from 10 countries were included.Their methodological quality was generally medium to high,with MMAT scores ranging from 60%to 100%.The synthesis yielded three core themes:1)the spectrum of professional and societal attitudes toward disclosure;2)the dynamic practices of navigating disclosure amid uncertainty,including timing and environment,stakeholders,and content of disclosure;and 3)factors influencing disclosure,including children’s,parental,healthcare professionals’,and socio-cultural factors.Conclusions This review synthesized the perspectives and experiences of healthcare professionals regarding disclosure in childhood cancer,highlighting the complexity and multidimensional nature of this process in clinical practice.Future research should further investigate the experiences and needs of children and their parents,explore cultural variations in disclosure practices,develop context-appropriate assessment tools,and construct multidimensional intervention strategies to enhance the humanistic care and professional effectiveness of the disclosure process.
文摘Generalised reduced masses with a set of equations governing the three relative motions between two of 3-bodies in their gravitational field are established,of which the dynamic characteristics of 3-body dynamics,fundamental bases of this paper,are revealed.Based on these findings,an equivalent system is developed,which is a 2-body system with its total mass,constant angular momentum,kinetic and potential energies same as the total ones of three relative motions,so that it can be solved using the well-known theory of the 2-body system.From the solution of an equivalent system with the revealed characteristics of three relative motions,the general theoretical solutions of the 3-body system are obtained in the curve-integration forms along the orbits in the imaged radial motion space.The possible periodical orbits with generalised Kepler’s law are presented.Following the description and mathematical demonstrations of the proposed methods,the examples including Euler’s/Lagrange’s problems,and a reported numerical one are solved to validate the proposed methods.The methods derived from the 3-body system are extended to N-body problems.
基金supported by the China Agriculture Research System of MOF and MARAthe National Natural Science Foundation of China (31872337 and 31501919)the Agricultural Science and Technology Innovation Project,China (ASTIP-IAS02)。
文摘The advantages of genome selection(GS) in animal and plant breeding are self-evident.Traditional parametric models have disadvantage in better fit the increasingly large sequencing data and capture complex effects accurately.Machine learning models have demonstrated remarkable potential in addressing these challenges.In this study,we introduced the concept of mixed kernel functions to explore the performance of support vector machine regression(SVR) in GS.Six single kernel functions(SVR_L,SVR_C,SVR_G,SVR_P,SVR_S,SVR_L) and four mixed kernel functions(SVR_GS,SVR_GP,SVR_LS,SVR_LP) were used to predict genome breeding values.The prediction accuracy,mean squared error(MSE) and mean absolute error(MAE) were used as evaluation indicators to compare with two traditional parametric models(GBLUP,BayesB) and two popular machine learning models(RF,KcRR).The results indicate that in most cases,the performance of the mixed kernel function model significantly outperforms that of GBLUP,BayesB and single kernel function.For instance,for T1 in the pig dataset,the predictive accuracy of SVR_GS is improved by 10% compared to GBLUP,and by approximately 4.4 and 18.6% compared to SVR_G and SVR_S respectively.For E1 in the wheat dataset,SVR_GS achieves 13.3% higher prediction accuracy than GBLUP.Among single kernel functions,the Laplacian and Gaussian kernel functions yield similar results,with the Gaussian kernel function performing better.The mixed kernel function notably reduces the MSE and MAE when compared to all single kernel functions.Furthermore,regarding runtime,SVR_GS and SVR_GP mixed kernel functions run approximately three times faster than GBLUP in the pig dataset,with only a slight increase in runtime compared to the single kernel function model.In summary,the mixed kernel function model of SVR demonstrates speed and accuracy competitiveness,and the model such as SVR_GS has important application potential for GS.
基金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.
文摘Pesticide poisoning remains a critical public health challenge worldwide.At present,chlorfenapyr,classifi ed by the World Health Organization(WHO)as a moderately toxic insecticide,is increasingly used in agriculture,leading to more poisoning incidents.It has a fatality rate as high as 76%after poisoning.[1]Here,we report a successful treatment of a patient with mixed pesticide poisoning caused by lethaldose emamectin benzoate(EB)and chlorfenapyr in the Department of Critical Care Medicine,Yangzhou Hongquan Hospital.
基金The National Natural Science Foundation of China(No. 50908235 )China Postdoctoral Science Foundation (No.201003520)
文摘An optimal dimension-down iterative algorithm （DDIA） is proposed for solving a mixed （continuous/ discrete） transportation network design problem （MNDP）, which is generally expressed as a mathematical programming with equilibrium constraints （MPEC）. The upper level of the MNDP aims to optimize the network performance via both the expansion of existing links and the addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium （UE） model. The idea of the proposed DDIA is to reduce the dimensions of the problem. A group of variables （discrete/continuous） are fixed to altemately optimize another group of variables （continuous/discrete）. Some continuous network design problems （CNDPs） and discrete network design problems （DNDPs） are solved repeatedly until the optimal solution is obtained. A numerical example is given to demonstrate the efficiency of the proposed algorithm.
基金Projects(50275150,61173052) supported by the National Natural Science Foundation of ChinaProject(14FJ3112) supported by the Planned Science and Technology of Hunan Province,ChinaProject(14B033) supported by Scientific Research Fund Education Department of Hunan Province,China
文摘A novel chaotic search method is proposed,and a hybrid algorithm combining particle swarm optimization(PSO) with this new method,called CLSPSO,is put forward to solve 14 integer and mixed integer programming problems.The performances of CLSPSO are compared with those of other five hybrid algorithms combining PSO with chaotic search methods.Experimental results indicate that in terms of robustness and final convergence speed,CLSPSO is better than other five algorithms in solving many of these problems.Furthermore,CLSPSO exhibits good performance in solving two high-dimensional problems,and it finds better solutions than the known ones.A performance index(PI) is introduced to fairly compare the above six algorithms,and the obtained values of(PI) in three cases demonstrate that CLSPSO is superior to all the other five algorithms under the same conditions.
基金supported by the Natural Science Foundation of Yibin University (No. 2009Z003)
文摘This paper uses a hybrid algorithm to find a common element of the set of solutions to a generalized mixed equilibrium problem, the set of solutions to variational inequality problems, and the set of common fixed points for a finite family of quasi-C- nonexpansive mappings in a uniformly smooth and strictly convex Banach space. As applications, we utilize our results to study the optimization problem. It shows that our results improve and extend the corresponding results announced by many others recently.
基金supported by the Scientific Research Fun of Sichuan Normal University (11ZDL01)the Sichuan Province Leading Academic Discipline Project (SZD0406)
文摘A new class of bilcvel generalized mixed equilibrium problems involving setvalued mappings is introduced and studied in a real Banach space. By using the auxiliary principle technique, new iterative algorithms for solving the generalized mixed equilibrium problems and bilevel generalized mixed equilibrium problems involving set-valued mappings are suggested and analyzed. Existence of solutions and strong convergence of the iterative sequences generated by the algorithms are proved under quite mild conditions. The behavior of the solution set of the generalized mixed equilibrium problems and bilevel generalized mixed equilibrium problems is also discussed. These results are new and generalize some recent results in this field.
基金supported by the National Natural Science Foundation of China (Grant 11502286)
文摘Without applying any stable element techniques in the mixed methods, two simple generalized mixed element(GME) formulations were derived by combining the minimum potential energy principle and Hellinger–Reissner(H–R) variational principle. The main features of the GME formulations are that the common C0-continuous polynomial shape functions for displacement methods are used to express both displacement and stress variables, and the coefficient matrix of these formulations is not only automatically symmetric but also invertible. Hence, the numerical results of the generalized mixed methods based on the GME formulations are stable. Displacement as well as stress results can be obtained directly from the algebraic system for finite element analysis after introducing stress and displacement boundary conditions simultaneously. Numerical examples show that displacement and stress results retain the same accuracy. The results of the noncompatible generalized mixed method proposed herein are more accurate than those of the standard noncompatible displacement method. The noncompatible generalized mixed element is less sensitive to element geometric distortions.
基金Project supported by the National Natural Science Foundation of China (Nos.10072033 and 10132010).
文摘The analytical continuation method is adopted to solve a mixed electric boundary value problem for a piezoelectric medium under anti-plane deformation.The crack face is partly conductive and partly impermeable.The results show that the stress intensity factor is identical with the mode Ⅲ stress intensity factor independent of the conducting length.But the electric field and the electric displacement are dependent on the electric boundary conditions on the crack faces and are singular not only at the crack tips but also at the junctures between the impermeable part and conducting portions.
文摘In this paper,the mixed initial-boundary value problem for general first order quasi-linear hyperbolic systems with nonlinear boundary conditions in the domain D={(t,x)|t≥0,x≥0}is considered.A sufficient condition to guarantee the existence and uniqueness of global weakly discontinuous solution is given.
基金Financial supports from the National Natural Science Foundation of China(No.51308196)
文摘Mixed-face ground encountered in Tunnel Boring Machine(TBM) tunneling presents great challenges and may trigger potential hazards without warning. A detailed understanding of such unfavorable conditions is therefore critical to a successful bored tunnel. In this paper, we firstly present a brief review of the definition, classification and the factors related to mixed-face conditions. Secondly, for a better understanding of this topic, we investigate the main difficulties and problems involved in TBM tunnelling under mixed-face ground with detailed cases. Thirdly, from the viewpoint of rock-machine interaction, we give some suggestions on the corresponding mitigation measurements from three categories:(i) selection of TBM type and modification of TBM,(ii) condition of ground and(iii) optimization of TBM operation.
文摘The method in [1] has been extended to the case of rotational flow in this paper. A new method for dealing with the shock wave is presented. This method has the advantages of both the shock-fitting and the shock capturing methods. The direct problem and the mixed direct-inverse prob- lem of the rotational flow in a transonic plane cascade at both design and off design conditions are solved, and the results show that the present method has rapid convergence rate and high accuracy even for the flow with moderately strong shocks. The calculations have been carried out on the DPS-8 computer, and for the direct problem, only 50-80 iterations are needed, and 50-80 seconds of CPU time are required.
