A unified approach called partition-and-recur for developing efficient and correct algorithmic programs is presented. An algorithm (represented by recurrence and initiation) is separated from program, and special att...A unified approach called partition-and-recur for developing efficient and correct algorithmic programs is presented. An algorithm (represented by recurrence and initiation) is separated from program, and special attention is paid to algorithm manipulation rather than program calculus. An algorithm is exactly a set of mathematical formulae. It is easier for formal derivation and proof. After getting efficient and correct algorithm, a trivial transformation is used to get a final program. The approach covers several known algorithm design techniques, e.g. dynamic programming, greedy, divide-and-conquer and enumeration, etc. The techniques of partition and recurrence are not new. Partition is a general approach for dealing with complicated objects and is typically used in divide-and-conquer approach. Recurrence is used in algorithm analysis, in developing loop invariants and dynamic programming approach. The main contribution is combining two techniques used in typical algorithm development into a unified and systematic approach to develop general efficient algorithmic programs and presenting a new representation of algorithm that is easier for understanding and demonstrating the correctness and ingenuity of algorithmic programs.展开更多
The loop invariants take a very important role in the design,proof and derivation of the algorithmic program.We point out the limitations of the traditional standard strategy for developing loop invariants, and propos...The loop invariants take a very important role in the design,proof and derivation of the algorithmic program.We point out the limitations of the traditional standard strategy for developing loop invariants, and propose two new strategies for proving the existing algorithmic program and developing new ones. The strategies use recurrence as vehicle and integrate some effective methods of designing algorithms, e.g.Dynamic Programming,Greedy and Divide Conquer,into the recurrence relation of problem solving sequence.This lets us get straightforward an approach for solving a variety of complicated prob- lems,and makes the standard proof and formal derivation of their algorithmic programs possible.We show the method and advantages of applying the strategies with several typical nontrivial examples.展开更多
In the present review, recent progress on the vortex identification methods are introduced with a focus on the newly proposed omega method（ Ω method）. The advantages of Ω method are summarized with many illustrati...In the present review, recent progress on the vortex identification methods are introduced with a focus on the newly proposed omega method（ Ω method）. The advantages of Ω method are summarized with many illustrating examples. Furthermore, comparing with other existing methods（e.g., Q criterion and λ2 criterion）, one of the characteristics of Ω method is its independence on the chosen threshold values for vortex identifications. The important parameters involved for the practical applications of Ω method are further discussed in detail together with the physical interpretation of the Ω and some suggestions of the future work. Other emerging topics（e.g., Lagrangian coherent structure and Rortex） are also introduced with comments.展开更多
Constructing a family of generalized Lyapunov functions, a new method is proposed to obtain new global attractive set and positive invariant set of the Lorenz chaotic system. The method we proposed greatly simplifies ...Constructing a family of generalized Lyapunov functions, a new method is proposed to obtain new global attractive set and positive invariant set of the Lorenz chaotic system. The method we proposed greatly simplifies the complex proofs of the two famous estimations presented by the Russian scholar Leonov. Our uniform formula can derive a series of the new estimations. Employing the idea of intersection in set theory, we extract a new Leonov formula-like estimation from the family of the estimations. With our method and the new estimation, one can confirm that there are no equilibrium, periodic solutions, almost periodic motions, wandering motions or other chaotic attractors outside the global attractive set. The Lorenz butterfly-like singular attractors are located in the global attractive set only. This result is applied to the chaos control and chaos synchronization. Some feedback control laws are obtained to guarantee that all the trajectories of the Lorenz systems track a periodic solution, or globally stabilize an unstable (or locally stable but not globally asymptotically stable) equilibrium. Further, some new global exponential chaos synchronization results are presented. Our new method and the new results are expected to be applied in real secure communication systems.展开更多
The invariant subspace method is refined to present more unity and more diversity of exact solutions to evolution equations. The key idea is to take subspaces of solutions to linear ordinary differential equations as ...The invariant subspace method is refined to present more unity and more diversity of exact solutions to evolution equations. The key idea is to take subspaces of solutions to linear ordinary differential equations as invariant subspaces that evolution equations admit. A two-component nonlinear system of dissipative equations is analyzed to shed light oi1 the resulting theory, and two concrete examples are given to find invariant subspaces associated with 2nd-order and 3rd-order linear ordinary differentii equations and their corresponding exact solutions with generalized separated variables.展开更多
The weakness of classical watermarking methods is the vulnerability to geometrical distortions that widely occur during normal use of the media. In this letter, a new image- watermarking method is presented to resist ...The weakness of classical watermarking methods is the vulnerability to geometrical distortions that widely occur during normal use of the media. In this letter, a new image- watermarking method is presented to resist Rotation, Scale and Translation (RST) attacks. The watermark is embedded into a domain obtained by taking Radon transform of a circular area selected from the original image, and then extracting Two-Dimensional (2-D) Fourier magnitude of the Radon transformed image. Furthermore, to prevent the watermarked image from degrading due to inverse Radon transform, watermark signal is inversely Radon transformed individually. Experimental results demonstrate that the proposed scheme is able to withstand a variety of attacks including common geometric attacks.展开更多
The invariant sets and the solutions of the 1+2-dimensional generalized thin film equation are discussed. It is shown that there exists a class of solutions to the equations, which are invariant with respect to the se...The invariant sets and the solutions of the 1+2-dimensional generalized thin film equation are discussed. It is shown that there exists a class of solutions to the equations, which are invariant with respect to the set $$E_0 = \{ u:u_x = v_x F(u),u_y = v_y F(u)\} ,$$ where v is a smooth function of variables x, y and F is a smooth function of u. This extends the results of Galaktionov (2001) and for the 1+1-dimensional nonlinear evolution equations.展开更多
The concepts of π-irreduciblity, recurrence and transience are introduced into the research field of Markov chains in random environments.That a π-irreducible chain must be either recurrent or transient is proved, a...The concepts of π-irreduciblity, recurrence and transience are introduced into the research field of Markov chains in random environments.That a π-irreducible chain must be either recurrent or transient is proved, a criterion is shown for recurrent Markov chains in double-infinite random environments, the existence of invariant measure of π-irreducible chains in double-infinite environments is discussed,and then Orey's open-questions are partially answered.展开更多
The famous von Neumann-Wold Theorem tells us that each analytic Toeplitz operator with n + 1-Blaschke factors is unitary to n + 1 copies of the unilateral shift on the Hardy space. It is obvious that the von Neumann-W...The famous von Neumann-Wold Theorem tells us that each analytic Toeplitz operator with n + 1-Blaschke factors is unitary to n + 1 copies of the unilateral shift on the Hardy space. It is obvious that the von Neumann-Wold Theorem does not hold in the Bergman space. In this paper, using the basis constructed by Michael and Zhu on the Bergman space we prove that each analytic Toeplitz operator M B(z) is similar to n + 1 copies of the Bergman shift if and only if B(z) is an n + 1-Blaschke product. From the above theorem, we characterize the similarity invariant of some analytic Toeplitz operators by using K 0-group term.展开更多
基金the 863 Hi-Tech Programmethe National Natural ScienceFoundation of China
文摘A unified approach called partition-and-recur for developing efficient and correct algorithmic programs is presented. An algorithm (represented by recurrence and initiation) is separated from program, and special attention is paid to algorithm manipulation rather than program calculus. An algorithm is exactly a set of mathematical formulae. It is easier for formal derivation and proof. After getting efficient and correct algorithm, a trivial transformation is used to get a final program. The approach covers several known algorithm design techniques, e.g. dynamic programming, greedy, divide-and-conquer and enumeration, etc. The techniques of partition and recurrence are not new. Partition is a general approach for dealing with complicated objects and is typically used in divide-and-conquer approach. Recurrence is used in algorithm analysis, in developing loop invariants and dynamic programming approach. The main contribution is combining two techniques used in typical algorithm development into a unified and systematic approach to develop general efficient algorithmic programs and presenting a new representation of algorithm that is easier for understanding and demonstrating the correctness and ingenuity of algorithmic programs.
基金Research supported by the National Natural Science Foundation of China.
文摘The loop invariants take a very important role in the design,proof and derivation of the algorithmic program.We point out the limitations of the traditional standard strategy for developing loop invariants, and propose two new strategies for proving the existing algorithmic program and developing new ones. The strategies use recurrence as vehicle and integrate some effective methods of designing algorithms, e.g.Dynamic Programming,Greedy and Divide Conquer,into the recurrence relation of problem solving sequence.This lets us get straightforward an approach for solving a variety of complicated prob- lems,and makes the standard proof and formal derivation of their algorithmic programs possible.We show the method and advantages of applying the strategies with several typical nontrivial examples.
基金Supposed by the National Natural Science Foundaion of China under Grant Nos.6053406060473094(国家自然科学基金)+1 种基金the National High-Tech Research and Development Plan of China under Grant No.2007AA01Z136(国家高技术研究发展计划(863))the National Basic Research Program ofChina under Grant No.2003CB317002(国家重点基础研究发展计划(973))
基金Project supported by the National Natural Science Foundation of China(Grant Nos.51506051,51606221)
文摘In the present review, recent progress on the vortex identification methods are introduced with a focus on the newly proposed omega method（ Ω method）. The advantages of Ω method are summarized with many illustrating examples. Furthermore, comparing with other existing methods（e.g., Q criterion and λ2 criterion）, one of the characteristics of Ω method is its independence on the chosen threshold values for vortex identifications. The important parameters involved for the practical applications of Ω method are further discussed in detail together with the physical interpretation of the Ω and some suggestions of the future work. Other emerging topics（e.g., Lagrangian coherent structure and Rortex） are also introduced with comments.
基金This work was supported by the National Natural Science Foundation of China(Grant Nos.60274007,60474011)the Guangdong Povince Science Foundation for Program of Research Team(Grant No.04205783).
文摘Constructing a family of generalized Lyapunov functions, a new method is proposed to obtain new global attractive set and positive invariant set of the Lorenz chaotic system. The method we proposed greatly simplifies the complex proofs of the two famous estimations presented by the Russian scholar Leonov. Our uniform formula can derive a series of the new estimations. Employing the idea of intersection in set theory, we extract a new Leonov formula-like estimation from the family of the estimations. With our method and the new estimation, one can confirm that there are no equilibrium, periodic solutions, almost periodic motions, wandering motions or other chaotic attractors outside the global attractive set. The Lorenz butterfly-like singular attractors are located in the global attractive set only. This result is applied to the chaos control and chaos synchronization. Some feedback control laws are obtained to guarantee that all the trajectories of the Lorenz systems track a periodic solution, or globally stabilize an unstable (or locally stable but not globally asymptotically stable) equilibrium. Further, some new global exponential chaos synchronization results are presented. Our new method and the new results are expected to be applied in real secure communication systems.
基金supported by the State Administration of Foreign Experts Affairs of China,National Natural Science Foundation of China (Grant Nos. 10971136,10831003,61072147,11071159)Chunhui Plan of the Ministry of Education of China,Zhejiang Innovation Project (Grant No. T200905)the Natural Science Foundation of Shanghai and the Shanghai Leading Academic Discipline Project (Grant No.J50101)
文摘The invariant subspace method is refined to present more unity and more diversity of exact solutions to evolution equations. The key idea is to take subspaces of solutions to linear ordinary differential equations as invariant subspaces that evolution equations admit. A two-component nonlinear system of dissipative equations is analyzed to shed light oi1 the resulting theory, and two concrete examples are given to find invariant subspaces associated with 2nd-order and 3rd-order linear ordinary differentii equations and their corresponding exact solutions with generalized separated variables.
文摘The weakness of classical watermarking methods is the vulnerability to geometrical distortions that widely occur during normal use of the media. In this letter, a new image- watermarking method is presented to resist Rotation, Scale and Translation (RST) attacks. The watermark is embedded into a domain obtained by taking Radon transform of a circular area selected from the original image, and then extracting Two-Dimensional (2-D) Fourier magnitude of the Radon transformed image. Furthermore, to prevent the watermarked image from degrading due to inverse Radon transform, watermark signal is inversely Radon transformed individually. Experimental results demonstrate that the proposed scheme is able to withstand a variety of attacks including common geometric attacks.
基金This work was supported by the National Natural Science Foundation of China (Grant No. 10671156)the Program for New Century Excellent Talents in Universities (Grant No. NCET-04-0968)
文摘The invariant sets and the solutions of the 1+2-dimensional generalized thin film equation are discussed. It is shown that there exists a class of solutions to the equations, which are invariant with respect to the set $$E_0 = \{ u:u_x = v_x F(u),u_y = v_y F(u)\} ,$$ where v is a smooth function of variables x, y and F is a smooth function of u. This extends the results of Galaktionov (2001) and for the 1+1-dimensional nonlinear evolution equations.
基金the Natural Science Foundation of Hunan Province (Grant No. 99JJY2001) Hunan Provincial Foundation for Young and Middleaged People (Grant No. 00JJEY2141) .
文摘The concepts of π-irreduciblity, recurrence and transience are introduced into the research field of Markov chains in random environments.That a π-irreducible chain must be either recurrent or transient is proved, a criterion is shown for recurrent Markov chains in double-infinite random environments, the existence of invariant measure of π-irreducible chains in double-infinite environments is discussed,and then Orey's open-questions are partially answered.
基金the National Natural Science Foundation of China (Grant No. 10571041)
文摘The famous von Neumann-Wold Theorem tells us that each analytic Toeplitz operator with n + 1-Blaschke factors is unitary to n + 1 copies of the unilateral shift on the Hardy space. It is obvious that the von Neumann-Wold Theorem does not hold in the Bergman space. In this paper, using the basis constructed by Michael and Zhu on the Bergman space we prove that each analytic Toeplitz operator M B(z) is similar to n + 1 copies of the Bergman shift if and only if B(z) is an n + 1-Blaschke product. From the above theorem, we characterize the similarity invariant of some analytic Toeplitz operators by using K 0-group term.
