The present paper is devoted to a novel smoothing function method for convex quadratic programming problem with mixed constrains, which has important application in mechanics and engineering science. The problem is re...The present paper is devoted to a novel smoothing function method for convex quadratic programming problem with mixed constrains, which has important application in mechanics and engineering science. The problem is reformulated as a system of non-smooth equations, and then a smoothing function for the system of non-smooth equations is proposed. The condition of convergences of this iteration algorithm is given. Theory analysis and primary numerical results illustrate that this method is feasible and effective.展开更多
This paper presents the Pareto solutions in continuous multi-objective mathematical programming. We discuss the role of some assumptions on the objective functions and feasible domain, the relationship between them, a...This paper presents the Pareto solutions in continuous multi-objective mathematical programming. We discuss the role of some assumptions on the objective functions and feasible domain, the relationship between them, and compactness, contractibility and fixed point properties of the Pareto sets. The authors have tried to remove the concavity assumptions on the objective functions which are usually used in multi-objective maximization problems. The results are based on constructing a retraction from the feasible domain onto the Pareto-optimal set.展开更多
An adaptive weighted stereo matching algorithm with multilevel and bidirectional dynamic programming based on ground control points （GCPs） is presented. To decrease time complexity without losing matching precision,...An adaptive weighted stereo matching algorithm with multilevel and bidirectional dynamic programming based on ground control points （GCPs） is presented. To decrease time complexity without losing matching precision, using a multilevel search scheme, the coarse matching is processed in typical disparity space image, while the fine matching is processed in disparity-offset space image. In the upper level, GCPs are obtained by enhanced volumetric iterative algorithm enforcing the mutual constraint and the threshold constraint. Under the supervision of the highly reliable GCPs, bidirectional dynamic programming framework is employed to solve the inconsistency in the optimization path. In the lower level, to reduce running time, disparity-offset space is proposed to efficiently achieve the dense disparity image. In addition, an adaptive dual support-weight strategy is presented to aggregate matching cost, which considers photometric and geometric information. Further, post-processing algorithm can ameliorate disparity results in areas with depth discontinuities and related by occlusions using dual threshold algorithm, where missing stereo information is substituted from surrounding regions. To demonstrate the effectiveness of the algorithm, we present the two groups of experimental results for four widely used standard stereo data sets, including discussion on performance and comparison with other methods, which show that the algorithm has not only a fast speed, but also significantly improves the efficiency of holistic optimization.展开更多
The matching and retrieval of the 2D shapes are challenging issues in object recognition and computer vision. In this paper, we propose a new object contour descriptor termed ECPDH (Elliptic Contour Points Distributio...The matching and retrieval of the 2D shapes are challenging issues in object recognition and computer vision. In this paper, we propose a new object contour descriptor termed ECPDH (Elliptic Contour Points Distribution Histogram), which is based on the distribution of the points on an object contour under the polar coordinates. ECPDH has the essential merits of invariance to scale and translation. Dynamic Programming (DP) algorithm is used to measure the distance between the ECPDHs. The effectiveness of the proposed method is demonstrated using some standard tests on MPEG-7 shape database. The results show the precision and recall of our method over other recent methods in the literature.展开更多
A new deterministic formulation,called the conditional expectation formulation,is proposed for dynamic stochastic programming problems in order to overcome some disadvantages of existing deterministic formulations.We ...A new deterministic formulation,called the conditional expectation formulation,is proposed for dynamic stochastic programming problems in order to overcome some disadvantages of existing deterministic formulations.We then check the impact of the new deterministic formulation and other two deterministic formulations on the corresponding problem size,nonzero elements and solution time by solving some typical dynamic stochastic programming problems with different interior point algorithms.Numerical results show the advantage and application of the new deterministic formulation.展开更多
In this paper, a nonlinear semiquantum Hamiltonian associated to the special unitary group SU(2) Lie algebra is studied so as to analyze its dynamics. The treatment here applied allows for a reduction in: 1) the syste...In this paper, a nonlinear semiquantum Hamiltonian associated to the special unitary group SU(2) Lie algebra is studied so as to analyze its dynamics. The treatment here applied allows for a reduction in: 1) the system’s dimension, as well as 2) the number of system’s parameters (to only three). We can now discern clear patterns in: 1) the complete characterization of the system’s fixed points and 2) their stability. It is shown that the parameter associated to the uncertainty principle, which constitutes a very strong constraint, is the key one in determining the presence of fixed points and bifurcation curves in the parameter’s space.展开更多
Existence of traveling wave solutions for some lattice differential equations is investigated. We prove that there exists c<sub>*</sub>>0 such that for each c≥c*</sub>, the systems und...Existence of traveling wave solutions for some lattice differential equations is investigated. We prove that there exists c<sub>*</sub>>0 such that for each c≥c*</sub>, the systems under consideration admit monotonic nondecreasing traveling waves.展开更多
In this paper we establish the existence, uniqueness and iterative approximation of solutions for two classes of functional equations arising in dynamic programming of multistage decision processes. The results presen...In this paper we establish the existence, uniqueness and iterative approximation of solutions for two classes of functional equations arising in dynamic programming of multistage decision processes. The results presented here extend, and unify the corresponding results due to Bellman, Bhakta and Choudhury, Bhakta and Mitra, Liu and others.展开更多
By casting evolution to the Bloch sphere, the dynamics of 2 × 2 matrix non-Hermitian systems are investigated in detail. This investigation reveals that there are four kinds of dynamical modes for such systems. T...By casting evolution to the Bloch sphere, the dynamics of 2 × 2 matrix non-Hermitian systems are investigated in detail. This investigation reveals that there are four kinds of dynamical modes for such systems. The different modes are classified by different kinds of fixed points, namely,the elliptic point, spiral point, critical node, and degenerate point. The Hermitian systems and the unbroken PT non-Hermitian cases belong to the category with elliptic points. The degenerate point just corresponds to the systems with exceptional point(EP). The topological properties of the fixed point are also discussed. It is interesting that the topological charge for the degenerate point is two, while the others are one.展开更多
Let Δυ be the unit ball in ?υ with center 0 (the origin of υ) and let F:Δυ→?υbe a holomorphic map withF(0) = 0. This paper is to study the fixed point multiplicities at the origin 0 of the iteratesF i =F°...Let Δυ be the unit ball in ?υ with center 0 (the origin of υ) and let F:Δυ→?υbe a holomorphic map withF(0) = 0. This paper is to study the fixed point multiplicities at the origin 0 of the iteratesF i =F°?°F (i times),i = 1,2,.... This problem is easy when υ = 1, but it is very complicated when υ > 1. We will study this problem generally.展开更多
Let △n be the ball |x| 【 1 in the complex vector space C n , let f :△n→ C n be a holomorphic mapping and let M be a positive integer. Assume that the origin 0 = (0, . . . , 0) is an isolated fixed point of both f ...Let △n be the ball |x| 【 1 in the complex vector space C n , let f :△n→ C n be a holomorphic mapping and let M be a positive integer. Assume that the origin 0 = (0, . . . , 0) is an isolated fixed point of both f and the M-th iteration f M of f. Then the (local) Dold index P M (f, 0) at the origin is well defined, which can be interpreted to be the number of virtual periodic points of period M of f hidden at the origin: any holomorphic mapping f 1 :△n→ C n sufficiently close to f has exactly P M (f, 0) distinct periodic points of period M near the origin, provided that all the fixed points of f M 1 near the origin are simple. Therefore, the number O M (f, 0) = P M (f, 0)/M can be understood to be the number of virtual periodic orbits of period M hidden at the fixed point. According to the works of Shub-Sullivan and Chow-Mallet-Paret-Yorke, a necessary condition so that there exists at least one virtual periodic orbit of period M hidden at the fixed point, i.e., O M (f, 0)≥1, is that the linear part of f at the origin has a periodic point of period M. It is proved by the author recently that the converse holds true. In this paper, we will study the condition for the linear part of f at 0 so that O M (f, 0)≥2. For a 2 × 2 matrix A that is arbitrarily given, the goal of this paper is to give a necessary and sufficient condition for A, such that O M (f, 0)≥2 for all holomorphic mappings f :△2 → C 2 such that f(0) = 0, Df(0) = A and that the origin 0 is an isolated fixed point of f M .展开更多
In this paper, we consider the existence of positive solutions to a three-point boundary value problem for second order dynamic equations with derivative on time scales.Applying Leggett-Williams fixed point theorem, w...In this paper, we consider the existence of positive solutions to a three-point boundary value problem for second order dynamic equations with derivative on time scales.Applying Leggett-Williams fixed point theorem, we obtain at least three positive solutions to the problem. An example is also presented to illustrate the applications of the results obtained.展开更多
文摘The present paper is devoted to a novel smoothing function method for convex quadratic programming problem with mixed constrains, which has important application in mechanics and engineering science. The problem is reformulated as a system of non-smooth equations, and then a smoothing function for the system of non-smooth equations is proposed. The condition of convergences of this iteration algorithm is given. Theory analysis and primary numerical results illustrate that this method is feasible and effective.
文摘This paper presents the Pareto solutions in continuous multi-objective mathematical programming. We discuss the role of some assumptions on the objective functions and feasible domain, the relationship between them, and compactness, contractibility and fixed point properties of the Pareto sets. The authors have tried to remove the concavity assumptions on the objective functions which are usually used in multi-objective maximization problems. The results are based on constructing a retraction from the feasible domain onto the Pareto-optimal set.
基金supported by the National Natural Science Foundation of China (No.60605023,60775048)Specialized Research Fund for the Doctoral Program of Higher Education (No.20060141006)
文摘An adaptive weighted stereo matching algorithm with multilevel and bidirectional dynamic programming based on ground control points （GCPs） is presented. To decrease time complexity without losing matching precision, using a multilevel search scheme, the coarse matching is processed in typical disparity space image, while the fine matching is processed in disparity-offset space image. In the upper level, GCPs are obtained by enhanced volumetric iterative algorithm enforcing the mutual constraint and the threshold constraint. Under the supervision of the highly reliable GCPs, bidirectional dynamic programming framework is employed to solve the inconsistency in the optimization path. In the lower level, to reduce running time, disparity-offset space is proposed to efficiently achieve the dense disparity image. In addition, an adaptive dual support-weight strategy is presented to aggregate matching cost, which considers photometric and geometric information. Further, post-processing algorithm can ameliorate disparity results in areas with depth discontinuities and related by occlusions using dual threshold algorithm, where missing stereo information is substituted from surrounding regions. To demonstrate the effectiveness of the algorithm, we present the two groups of experimental results for four widely used standard stereo data sets, including discussion on performance and comparison with other methods, which show that the algorithm has not only a fast speed, but also significantly improves the efficiency of holistic optimization.
文摘The matching and retrieval of the 2D shapes are challenging issues in object recognition and computer vision. In this paper, we propose a new object contour descriptor termed ECPDH (Elliptic Contour Points Distribution Histogram), which is based on the distribution of the points on an object contour under the polar coordinates. ECPDH has the essential merits of invariance to scale and translation. Dynamic Programming (DP) algorithm is used to measure the distance between the ECPDHs. The effectiveness of the proposed method is demonstrated using some standard tests on MPEG-7 shape database. The results show the precision and recall of our method over other recent methods in the literature.
基金This research was partially supported by the Natural Science Research Foundation of Shaanxi Province(2001SL09)
文摘A new deterministic formulation,called the conditional expectation formulation,is proposed for dynamic stochastic programming problems in order to overcome some disadvantages of existing deterministic formulations.We then check the impact of the new deterministic formulation and other two deterministic formulations on the corresponding problem size,nonzero elements and solution time by solving some typical dynamic stochastic programming problems with different interior point algorithms.Numerical results show the advantage and application of the new deterministic formulation.
文摘In this paper, a nonlinear semiquantum Hamiltonian associated to the special unitary group SU(2) Lie algebra is studied so as to analyze its dynamics. The treatment here applied allows for a reduction in: 1) the system’s dimension, as well as 2) the number of system’s parameters (to only three). We can now discern clear patterns in: 1) the complete characterization of the system’s fixed points and 2) their stability. It is shown that the parameter associated to the uncertainty principle, which constitutes a very strong constraint, is the key one in determining the presence of fixed points and bifurcation curves in the parameter’s space.
文摘Existence of traveling wave solutions for some lattice differential equations is investigated. We prove that there exists c<sub>*</sub>>0 such that for each c≥c*</sub>, the systems under consideration admit monotonic nondecreasing traveling waves.
文摘In this paper we establish the existence, uniqueness and iterative approximation of solutions for two classes of functional equations arising in dynamic programming of multistage decision processes. The results presented here extend, and unify the corresponding results due to Bellman, Bhakta and Choudhury, Bhakta and Mitra, Liu and others.
基金supported by the National Natural Science Foundation of China(Grant No.12088101,and U2330401).
文摘By casting evolution to the Bloch sphere, the dynamics of 2 × 2 matrix non-Hermitian systems are investigated in detail. This investigation reveals that there are four kinds of dynamical modes for such systems. The different modes are classified by different kinds of fixed points, namely,the elliptic point, spiral point, critical node, and degenerate point. The Hermitian systems and the unbroken PT non-Hermitian cases belong to the category with elliptic points. The degenerate point just corresponds to the systems with exceptional point(EP). The topological properties of the fixed point are also discussed. It is interesting that the topological charge for the degenerate point is two, while the others are one.
文摘Let Δυ be the unit ball in ?υ with center 0 (the origin of υ) and let F:Δυ→?υbe a holomorphic map withF(0) = 0. This paper is to study the fixed point multiplicities at the origin 0 of the iteratesF i =F°?°F (i times),i = 1,2,.... This problem is easy when υ = 1, but it is very complicated when υ > 1. We will study this problem generally.
基金supported by National Natural Science Foundation of China (Grant No.10971112)
文摘Let △n be the ball |x| 【 1 in the complex vector space C n , let f :△n→ C n be a holomorphic mapping and let M be a positive integer. Assume that the origin 0 = (0, . . . , 0) is an isolated fixed point of both f and the M-th iteration f M of f. Then the (local) Dold index P M (f, 0) at the origin is well defined, which can be interpreted to be the number of virtual periodic points of period M of f hidden at the origin: any holomorphic mapping f 1 :△n→ C n sufficiently close to f has exactly P M (f, 0) distinct periodic points of period M near the origin, provided that all the fixed points of f M 1 near the origin are simple. Therefore, the number O M (f, 0) = P M (f, 0)/M can be understood to be the number of virtual periodic orbits of period M hidden at the fixed point. According to the works of Shub-Sullivan and Chow-Mallet-Paret-Yorke, a necessary condition so that there exists at least one virtual periodic orbit of period M hidden at the fixed point, i.e., O M (f, 0)≥1, is that the linear part of f at the origin has a periodic point of period M. It is proved by the author recently that the converse holds true. In this paper, we will study the condition for the linear part of f at 0 so that O M (f, 0)≥2. For a 2 × 2 matrix A that is arbitrarily given, the goal of this paper is to give a necessary and sufficient condition for A, such that O M (f, 0)≥2 for all holomorphic mappings f :△2 → C 2 such that f(0) = 0, Df(0) = A and that the origin 0 is an isolated fixed point of f M .
基金supported by Innovation Project for Graduate Education of Shandong Province(SDYY10058)
文摘In this paper, we consider the existence of positive solutions to a three-point boundary value problem for second order dynamic equations with derivative on time scales.Applying Leggett-Williams fixed point theorem, we obtain at least three positive solutions to the problem. An example is also presented to illustrate the applications of the results obtained.
