The paper addresses a contact problem of the theory of elasticity,i.e.,the penetration of a circular indenter with a flat base into a soft functionally graded elastic layer.The elastic properties of a functionally gra...The paper addresses a contact problem of the theory of elasticity,i.e.,the penetration of a circular indenter with a flat base into a soft functionally graded elastic layer.The elastic properties of a functionally graded layer arbitrarily vary with depth,and the foundation is assumed to be elastic,yet much harder than a layer.Approximated analytical solution is constructed,and it is shown that the solutions are asymptotically exact both for large and small values of characteristic dimensionless geometrical parameter of the problem.Numerical examples are analyzed for the cases of monotonic and nonmonotonic variations of elastic properties.Numerical results for the case of homogeneous layer are compared with the results for nondeformable foundation.展开更多
A meshless numerical model is developed for analyzing transient heat conductions in three-dimensional （3D） axisymmetric continuously nonhomogeneous functionally graded materials （FGMs）. Axial symmetry of geometry ...A meshless numerical model is developed for analyzing transient heat conductions in three-dimensional （3D） axisymmetric continuously nonhomogeneous functionally graded materials （FGMs）. Axial symmetry of geometry and boundary conditions reduces the original 3D initial-boundary value problem into a two-dimensional （2D） problem. Local weak forms are derived for small polygonal sub-domains which surround nodal points distributed over the cross section. In order to simplify the treatment of the essential boundary conditions, spatial variations of the temperature and heat flux at discrete time instants are interpolated by the natural neighbor interpolation. Moreover, the using of three-node triangular finite element method （FEM） shape functions as test functions reduces the orders of integrands involved in domain integrals. The semi-discrete heat conduction equation is solved numerically with the traditional two-point difference technique in the time domain. Two numerical examples are investigated and excellent results are obtained, demonstrating the potential application of the proposed approach.展开更多
In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a （weakly） LU-efficient solution in the considered nonsmooth multiobjective programming problem with the mult...In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a （weakly） LU-efficient solution in the considered nonsmooth multiobjective programming problem with the multiple interval-objective function. Further, the sufficient optimality conditions for a （weakly） LU-efficient solution and several duality results in Mond-Weir sense are proved under assumptions that the functions constituting the considered nondifferentiable multiobjective programming problem with the multiple interval- objective function are convex.展开更多
A mechanism for proving global convergence in filter-SQP （sequence of quadratic programming） method with the nonlinear complementarity problem （NCP） function is described for constrained nonlinear optimization pro...A mechanism for proving global convergence in filter-SQP （sequence of quadratic programming） method with the nonlinear complementarity problem （NCP） function is described for constrained nonlinear optimization problem.We introduce an NCP function into the filter and construct a new SQP-filter algorithm.Such methods are characterized by their use of the dominance concept of multi-objective optimization,instead of a penalty parameter whose adjustment can be problematic.We prove that the algorithm has global convergence and superlinear convergence rates under some mild conditions.展开更多
A fundamental solution was obtained for an infinite plane bonded by two dissimilar isotropic semi-planes by employing plane elastic complex variable method and theory of boundary value problems for analytic functions....A fundamental solution was obtained for an infinite plane bonded by two dissimilar isotropic semi-planes by employing plane elastic complex variable method and theory of boundary value problems for analytic functions.Fundamental solution was prepared for solving these types of problems with boundary element method.展开更多
Three dimensional frictional contact problems are formulated as linear complementarity problems based on the parametric variational principle. Two aggregate-functionbased algorithms for solving complementarity problem...Three dimensional frictional contact problems are formulated as linear complementarity problems based on the parametric variational principle. Two aggregate-functionbased algorithms for solving complementarity problems are proposed. One is called the self-adjusting interior point algorithm, the other is called the aggregate function smoothing algorithm. Numerical experiment shows the efficiency of the proposed two algorithms.展开更多
A new algorithm based on genetic algorithm(GA) is developed for solving function optimization problems with inequality constraints. This algorithm has been used to a series of standard test problems and exhibited good...A new algorithm based on genetic algorithm(GA) is developed for solving function optimization problems with inequality constraints. This algorithm has been used to a series of standard test problems and exhibited good performance. The computation results show that its generality, precision, robustness, simplicity and performance are all satisfactory.展开更多
Chimp Optimization Algorithm(ChOA)is one of the most efficient recent optimization algorithms,which proved its ability to deal with different problems in various do-mains.However,ChOA suffers from the weakness of the ...Chimp Optimization Algorithm(ChOA)is one of the most efficient recent optimization algorithms,which proved its ability to deal with different problems in various do-mains.However,ChOA suffers from the weakness of the local search technique which leads to a loss of diversity,getting stuck in a local minimum,and procuring premature convergence.In response to these defects,this paper proposes an improved ChOA algorithm based on using Opposition-based learning(OBL)to enhance the choice of better solutions,written as OChOA.Then,utilizing Reinforcement Learning(RL)to improve the local research technique of OChOA,called RLOChOA.This way effectively avoids the algorithm falling into local optimum.The performance of the proposed RLOChOA algorithm is evaluated using the Friedman rank test on a set of CEC 2015 and CEC 2017 benchmark functions problems and a set of CEC 2011 real-world problems.Numerical results and statistical experiments show that RLOChOA provides better solution quality,convergence accuracy and stability compared with other state-of-the-art algorithms.展开更多
Refinery complexity quantifies the sophistication and capital intensity of a refinery and has found widespread application in facility classification, cost estimation, sales price models, and other uses. Despite the u...Refinery complexity quantifies the sophistication and capital intensity of a refinery and has found widespread application in facility classification, cost estimation, sales price models, and other uses. Despite the ubiquity and widespread use of refining complexity, however, surprisingly little material has been written on its applications. The pur- pose of this review is to describe the primary applications of refinery complexity and some recent extensions. A secondary purpose of this review is to provide a framework that unifies complexity applications and suggests avenues for future research. Examples illustrate the applications considered.展开更多
Fractional calculus and special functions have contributed a lot to mathematical physics and its various branches. The great use of mathematical physics in distinguished astrophysical problems has attracted astronomer...Fractional calculus and special functions have contributed a lot to mathematical physics and its various branches. The great use of mathematical physics in distinguished astrophysical problems has attracted astronomers and physicists to pay more attention to available mathematical tools that can be widely used in solving several problems of astrophysics/physics. In view of the great importance and usefulness of kinetic equations in certain astrophysical problems, the authors derive a generalized fractional kinetic equation involving the Lorenzo-Hartley function, a generalized function for fractional calculus. The fractional kinetic equation discussed here can be used to investigate a wide class of known （and possibly also new） fractional kinetic equations, hitherto scattered in the literature. A compact and easily computable solution is established in terms of the Lorenzo-Hartley function. Special cases, involving the generalized Mittag-Leffler function and the R-function, are considered. The obtained results imply the known results more precisely.展开更多
This paper proposes an approach for functional knowledge representation based on problem reduction,which represents the organization of problem-solving activities in two levels:reduction and reasoning.The former makes...This paper proposes an approach for functional knowledge representation based on problem reduction,which represents the organization of problem-solving activities in two levels:reduction and reasoning.The former makes the functional plans for problem-solving while the latter constructs functional units, called handlers,for executing subproblems designated by these plans.This approach emphasizes that the representation of domain knowledge should be closely combined with(rather than separated from)its use therefore provides a set of reasoning-level primitives to construct handlers and formulate the control strate- gies for executing them.As reduction-level primitives,handlers are used to construct handler-associative networks,which become the executable representation of problem-reduction graphs,in order to realize the problem-solving methods suited to domain features.Besides,handlers and their control slots can be used to focus the attention of knowledge acquisition and reasoning control.展开更多
This paper is concerned with the existence, uniqueness, comparison and dynamics problem of a functional reaction-diffusion problem. The existence and uniqueness of the global C1,2 strong solution to the problem is der...This paper is concerned with the existence, uniqueness, comparison and dynamics problem of a functional reaction-diffusion problem. The existence and uniqueness of the global C1,2 strong solution to the problem is derived using Schauder fixed point theorem in Banach space instead of the Ascoli-Arzela theorem in the unbounded region, meanwhile, the maximal and minimal solutions are also presented by the monotone iteration method with a pair of supper and lower solutions as the initial iteration.展开更多
In this article, we establish the existence of at least two positive solutions for the semi-positone m-point boundary value problem with a parameter u （t） ＋ λf （t, u） = 0, t ∈ （0, 1）, u （0） = sum （biu （ξ...In this article, we establish the existence of at least two positive solutions for the semi-positone m-point boundary value problem with a parameter u （t） ＋ λf （t, u） = 0, t ∈ （0, 1）, u （0） = sum （biu （ξ i ）） from i=1 to m-2, u（1）= sum （aiu（ξ i ）） from i=1 to m-2, where λ 〉 0 is a parameter, 0 〈 ξ 1 〈 ξ 2 〈 ··· 〈 ξ m 2 〈 1 with 0 〈sum ai from i=1 to m-2 〈 1, sum bi from i=1 to m-2 =1 b i 〈 1, a i , b i ∈ [0, ∞） and f （t, u） ≥ M with M is a positive constant. The method employed is the Leggett-Williams fixed-point theorem. As an application, an example is given to demonstrate the main result.展开更多
In this paper, new solutions for the problem of pose estimation from correspondences between 3D model lines and 2D image lines are proposed. Traditional line-based pose estimation methods rely on the assumption that t...In this paper, new solutions for the problem of pose estimation from correspondences between 3D model lines and 2D image lines are proposed. Traditional line-based pose estimation methods rely on the assumption that the noises(perpendicular to the line) for the two endpoints are statistically independent. However, these two noises are in fact negatively correlated when the image line segment is fitted using the least-squares technique. Therefore, we design a new error function expressed by the average integral of the distance between line segments. Three least-squares techniques that optimize both the rotation and translation simultaneously are proposed in which the new error function is exploited. In addition, Lie group formalism is utilized to describe the pose parameters, and then, the optimization problem can be solved by means of a simple iterative least squares method. To enhance the robustness to outliers existing in the match data, an M-estimation method is developed to convert the pose optimization problem into an iterative reweighted least squares problem. The proposed methods are validated through experiments using both synthetic and real-world data. The experimental results show that the proposed methods yield a clearly higher precision than the traditional methods.展开更多
We consider a strictly pathwise setting for Delta hedging exotic options,based on Follmer’s pathwise It¨o calculus.Price trajectories areˆd-dimensional continuous functions whose pathwise quadratic variations an...We consider a strictly pathwise setting for Delta hedging exotic options,based on Follmer’s pathwise It¨o calculus.Price trajectories areˆd-dimensional continuous functions whose pathwise quadratic variations and covariations are determined by a given local volatility matrix.The existence of Delta hedging strategies in this pathwise setting is established via existence results for recursive schemes of parabolic Cauchy problems and via the existence of functional Cauchy problems on path space.Our main results establish the nonexistence of pathwise arbitrage opportunities in classes of strategies containing these Delta hedging strategies and under relatively mild conditions on the local volatility matrix.展开更多
The(continuous) finite element approximations of different orders for the computation of the solution to electronic structures were proposed in some papers and the performance of these approaches is becoming appreciab...The(continuous) finite element approximations of different orders for the computation of the solution to electronic structures were proposed in some papers and the performance of these approaches is becoming appreciable and is now well understood.In this publication,the author proposes to extend this discretization for full-potential electronic structure calculations by combining the refinement of the finite element mesh,where the solution is most singular with the increase of the degree of the polynomial approximations in the regions where the solution is mostly regular.This combination of increase of approximation properties,done in an a priori or a posteriori manner,is well-known to generally produce an optimal exponential type convergence rate with respect to the number of degrees of freedom even when the solution is singular.The analysis performed here sustains this property in the case of Hartree-Fock and Kohn-Sham problems.展开更多
基金supports of the Ministry of Education and Science of Russia (11.519.11.3028,14.B37.21.1131,14.B7.21.1632)Russian Foundation of Basic Research (11-08-91168-GFEN a)
文摘The paper addresses a contact problem of the theory of elasticity,i.e.,the penetration of a circular indenter with a flat base into a soft functionally graded elastic layer.The elastic properties of a functionally graded layer arbitrarily vary with depth,and the foundation is assumed to be elastic,yet much harder than a layer.Approximated analytical solution is constructed,and it is shown that the solutions are asymptotically exact both for large and small values of characteristic dimensionless geometrical parameter of the problem.Numerical examples are analyzed for the cases of monotonic and nonmonotonic variations of elastic properties.Numerical results for the case of homogeneous layer are compared with the results for nondeformable foundation.
基金Project supported by the National Natural Science Foundation of China(Grant No.11002054)the Foundation of Hunan Educational Committee(Grant No.12C0059).
文摘A meshless numerical model is developed for analyzing transient heat conductions in three-dimensional （3D） axisymmetric continuously nonhomogeneous functionally graded materials （FGMs）. Axial symmetry of geometry and boundary conditions reduces the original 3D initial-boundary value problem into a two-dimensional （2D） problem. Local weak forms are derived for small polygonal sub-domains which surround nodal points distributed over the cross section. In order to simplify the treatment of the essential boundary conditions, spatial variations of the temperature and heat flux at discrete time instants are interpolated by the natural neighbor interpolation. Moreover, the using of three-node triangular finite element method （FEM） shape functions as test functions reduces the orders of integrands involved in domain integrals. The semi-discrete heat conduction equation is solved numerically with the traditional two-point difference technique in the time domain. Two numerical examples are investigated and excellent results are obtained, demonstrating the potential application of the proposed approach.
文摘In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a （weakly） LU-efficient solution in the considered nonsmooth multiobjective programming problem with the multiple interval-objective function. Further, the sufficient optimality conditions for a （weakly） LU-efficient solution and several duality results in Mond-Weir sense are proved under assumptions that the functions constituting the considered nondifferentiable multiobjective programming problem with the multiple interval- objective function are convex.
基金Project supported by the National Natural Science Foundation of China (Grant Nos.10571137,10771162)
文摘A mechanism for proving global convergence in filter-SQP （sequence of quadratic programming） method with the nonlinear complementarity problem （NCP） function is described for constrained nonlinear optimization problem.We introduce an NCP function into the filter and construct a new SQP-filter algorithm.Such methods are characterized by their use of the dominance concept of multi-objective optimization,instead of a penalty parameter whose adjustment can be problematic.We prove that the algorithm has global convergence and superlinear convergence rates under some mild conditions.
文摘A fundamental solution was obtained for an infinite plane bonded by two dissimilar isotropic semi-planes by employing plane elastic complex variable method and theory of boundary value problems for analytic functions.Fundamental solution was prepared for solving these types of problems with boundary element method.
基金The project supported by the National Natural Science foundation of china(10225212,50178016.10302007)the National Kev Basic Research Special Foundation and the Ministry of Education of China
文摘Three dimensional frictional contact problems are formulated as linear complementarity problems based on the parametric variational principle. Two aggregate-functionbased algorithms for solving complementarity problems are proposed. One is called the self-adjusting interior point algorithm, the other is called the aggregate function smoothing algorithm. Numerical experiment shows the efficiency of the proposed two algorithms.
文摘A new algorithm based on genetic algorithm(GA) is developed for solving function optimization problems with inequality constraints. This algorithm has been used to a series of standard test problems and exhibited good performance. The computation results show that its generality, precision, robustness, simplicity and performance are all satisfactory.
文摘Chimp Optimization Algorithm(ChOA)is one of the most efficient recent optimization algorithms,which proved its ability to deal with different problems in various do-mains.However,ChOA suffers from the weakness of the local search technique which leads to a loss of diversity,getting stuck in a local minimum,and procuring premature convergence.In response to these defects,this paper proposes an improved ChOA algorithm based on using Opposition-based learning(OBL)to enhance the choice of better solutions,written as OChOA.Then,utilizing Reinforcement Learning(RL)to improve the local research technique of OChOA,called RLOChOA.This way effectively avoids the algorithm falling into local optimum.The performance of the proposed RLOChOA algorithm is evaluated using the Friedman rank test on a set of CEC 2015 and CEC 2017 benchmark functions problems and a set of CEC 2011 real-world problems.Numerical results and statistical experiments show that RLOChOA provides better solution quality,convergence accuracy and stability compared with other state-of-the-art algorithms.
文摘Refinery complexity quantifies the sophistication and capital intensity of a refinery and has found widespread application in facility classification, cost estimation, sales price models, and other uses. Despite the ubiquity and widespread use of refining complexity, however, surprisingly little material has been written on its applications. The pur- pose of this review is to describe the primary applications of refinery complexity and some recent extensions. A secondary purpose of this review is to provide a framework that unifies complexity applications and suggests avenues for future research. Examples illustrate the applications considered.
文摘Fractional calculus and special functions have contributed a lot to mathematical physics and its various branches. The great use of mathematical physics in distinguished astrophysical problems has attracted astronomers and physicists to pay more attention to available mathematical tools that can be widely used in solving several problems of astrophysics/physics. In view of the great importance and usefulness of kinetic equations in certain astrophysical problems, the authors derive a generalized fractional kinetic equation involving the Lorenzo-Hartley function, a generalized function for fractional calculus. The fractional kinetic equation discussed here can be used to investigate a wide class of known （and possibly also new） fractional kinetic equations, hitherto scattered in the literature. A compact and easily computable solution is established in terms of the Lorenzo-Hartley function. Special cases, involving the generalized Mittag-Leffler function and the R-function, are considered. The obtained results imply the known results more precisely.
基金This research was supported by National High-tech Program(863 Program)of P.R.China.
文摘This paper proposes an approach for functional knowledge representation based on problem reduction,which represents the organization of problem-solving activities in two levels:reduction and reasoning.The former makes the functional plans for problem-solving while the latter constructs functional units, called handlers,for executing subproblems designated by these plans.This approach emphasizes that the representation of domain knowledge should be closely combined with(rather than separated from)its use therefore provides a set of reasoning-level primitives to construct handlers and formulate the control strate- gies for executing them.As reduction-level primitives,handlers are used to construct handler-associative networks,which become the executable representation of problem-reduction graphs,in order to realize the problem-solving methods suited to domain features.Besides,handlers and their control slots can be used to focus the attention of knowledge acquisition and reasoning control.
基金supported by the NSF of Shandong Province (No.ZR2010AL013, Y2008A31)
文摘This paper is concerned with the existence, uniqueness, comparison and dynamics problem of a functional reaction-diffusion problem. The existence and uniqueness of the global C1,2 strong solution to the problem is derived using Schauder fixed point theorem in Banach space instead of the Ascoli-Arzela theorem in the unbounded region, meanwhile, the maximal and minimal solutions are also presented by the monotone iteration method with a pair of supper and lower solutions as the initial iteration.
基金Supported by Fund of National Natural Science of China (No. 10371068)Science Foundation of Business College of Shanxi University (No. 2008053)
文摘In this article, we establish the existence of at least two positive solutions for the semi-positone m-point boundary value problem with a parameter u （t） ＋ λf （t, u） = 0, t ∈ （0, 1）, u （0） = sum （biu （ξ i ）） from i=1 to m-2, u（1）= sum （aiu（ξ i ）） from i=1 to m-2, where λ 〉 0 is a parameter, 0 〈 ξ 1 〈 ξ 2 〈 ··· 〈 ξ m 2 〈 1 with 0 〈sum ai from i=1 to m-2 〈 1, sum bi from i=1 to m-2 =1 b i 〈 1, a i , b i ∈ [0, ∞） and f （t, u） ≥ M with M is a positive constant. The method employed is the Leggett-Williams fixed-point theorem. As an application, an example is given to demonstrate the main result.
基金supported by the National Basic Research Program of China(“973”Project)(Grant No.2013CB733100)National Natural Science Foundation of China(Grant No.11332012)
文摘In this paper, new solutions for the problem of pose estimation from correspondences between 3D model lines and 2D image lines are proposed. Traditional line-based pose estimation methods rely on the assumption that the noises(perpendicular to the line) for the two endpoints are statistically independent. However, these two noises are in fact negatively correlated when the image line segment is fitted using the least-squares technique. Therefore, we design a new error function expressed by the average integral of the distance between line segments. Three least-squares techniques that optimize both the rotation and translation simultaneously are proposed in which the new error function is exploited. In addition, Lie group formalism is utilized to describe the pose parameters, and then, the optimization problem can be solved by means of a simple iterative least squares method. To enhance the robustness to outliers existing in the match data, an M-estimation method is developed to convert the pose optimization problem into an iterative reweighted least squares problem. The proposed methods are validated through experiments using both synthetic and real-world data. The experimental results show that the proposed methods yield a clearly higher precision than the traditional methods.
基金support by Deutsche Forschungsgemeinschaft through the Research Training Group RTG 1953.
文摘We consider a strictly pathwise setting for Delta hedging exotic options,based on Follmer’s pathwise It¨o calculus.Price trajectories areˆd-dimensional continuous functions whose pathwise quadratic variations and covariations are determined by a given local volatility matrix.The existence of Delta hedging strategies in this pathwise setting is established via existence results for recursive schemes of parabolic Cauchy problems and via the existence of functional Cauchy problems on path space.Our main results establish the nonexistence of pathwise arbitrage opportunities in classes of strategies containing these Delta hedging strategies and under relatively mild conditions on the local volatility matrix.
文摘The(continuous) finite element approximations of different orders for the computation of the solution to electronic structures were proposed in some papers and the performance of these approaches is becoming appreciable and is now well understood.In this publication,the author proposes to extend this discretization for full-potential electronic structure calculations by combining the refinement of the finite element mesh,where the solution is most singular with the increase of the degree of the polynomial approximations in the regions where the solution is mostly regular.This combination of increase of approximation properties,done in an a priori or a posteriori manner,is well-known to generally produce an optimal exponential type convergence rate with respect to the number of degrees of freedom even when the solution is singular.The analysis performed here sustains this property in the case of Hartree-Fock and Kohn-Sham problems.
