With the security problem of image information as the background, some more properties of the period of Arnold transformation of two-dimension were studied by means of introducing a integer sequence. Some new resuits ...With the security problem of image information as the background, some more properties of the period of Arnold transformation of two-dimension were studied by means of introducing a integer sequence. Some new resuits are obtained. Two interesting conjectures on the period of Arnold transformation are given. When making digital images scrambling by Arnold transformation, it is important to know the period of the transformation for the image. As the application of the theory, a new method for computing the periods at last are proposed.展开更多
For optimizing the cutting depth of spiral drum type cutting head,the relations among collecting ratio,interfusing ratio of mullock and cutting depth of the mining cobalt-rich crusts in ocean were discussed.Furthermor...For optimizing the cutting depth of spiral drum type cutting head,the relations among collecting ratio,interfusing ratio of mullock and cutting depth of the mining cobalt-rich crusts in ocean were discussed.Furthermore,the multi-extremum problem about cutting depth was analyzed in mining at a certain interfusing ratio of mullock.Through introducing genetic algorithm(GA),the cutting depth-control problem when the collecting ratio is maximized by controlling the interfusing ratio of mullock was solved with global-optimization-search algorithms.Then optimization theory for cutting depth in mining cobalt-rich crusts by GA,and computer programming were given to realize the algorithm.The computation result of actual data proves the validity of this method.展开更多
In this paper,we propose a three-term conjugate gradient method for solving unconstrained optimization problems based on the Hestenes-Stiefel(HS)conjugate gradient method and Polak-Ribiere-Polyak(PRP)conjugate gradien...In this paper,we propose a three-term conjugate gradient method for solving unconstrained optimization problems based on the Hestenes-Stiefel(HS)conjugate gradient method and Polak-Ribiere-Polyak(PRP)conjugate gradient method.Under the condition of standard Wolfe line search,the proposed search direction is the descent direction.For general nonlinear functions,the method is globally convergent.Finally,numerical results show that the proposed method is efficient.展开更多
基金Project (10471020) supported by the National Natural Science Foundation project (04JJ6028) supported by the Natural Science Foundation of Hunan Province project (03A002) supported by the Ministry of Education of Hunan Province
文摘With the security problem of image information as the background, some more properties of the period of Arnold transformation of two-dimension were studied by means of introducing a integer sequence. Some new resuits are obtained. Two interesting conjectures on the period of Arnold transformation are given. When making digital images scrambling by Arnold transformation, it is important to know the period of the transformation for the image. As the application of the theory, a new method for computing the periods at last are proposed.
基金Project(50474052)supported by the National Natural Science Foundation of ChinaProject(2005) supported by the Youthful Teacher Skeleton Foundation of Hunan Province, ChinaProject supported by the Postdoctoral Foundation of China
文摘For optimizing the cutting depth of spiral drum type cutting head,the relations among collecting ratio,interfusing ratio of mullock and cutting depth of the mining cobalt-rich crusts in ocean were discussed.Furthermore,the multi-extremum problem about cutting depth was analyzed in mining at a certain interfusing ratio of mullock.Through introducing genetic algorithm(GA),the cutting depth-control problem when the collecting ratio is maximized by controlling the interfusing ratio of mullock was solved with global-optimization-search algorithms.Then optimization theory for cutting depth in mining cobalt-rich crusts by GA,and computer programming were given to realize the algorithm.The computation result of actual data proves the validity of this method.
基金This work was supported in part by the National Natural Science Foundation of China （11562006, 11661025）, the Outstanding Young Teachers Training in Higher Education Institutions of Guangxi （gxqg022014025）, and the Natural Science Foundation of Guangxi Province （2015GXNSFAA139013）.
基金Supported by the Science and Technology Project of Guangxi(Guike AD23023002)。
文摘In this paper,we propose a three-term conjugate gradient method for solving unconstrained optimization problems based on the Hestenes-Stiefel(HS)conjugate gradient method and Polak-Ribiere-Polyak(PRP)conjugate gradient method.Under the condition of standard Wolfe line search,the proposed search direction is the descent direction.For general nonlinear functions,the method is globally convergent.Finally,numerical results show that the proposed method is efficient.
