期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Definition of Measure-theoretic Pressure Using Spanning Sets 被引量:7
1
作者 LianFaHE JinFengLV LiNaZHOU 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2004年第4期709-718,共10页
We introduce a new definition of measure-theoretic pressure for ergodic measures of con- tinuous maps on a compact metric space.This definition is similar to those of topological pressure involving spanning sets.As an... We introduce a new definition of measure-theoretic pressure for ergodic measures of con- tinuous maps on a compact metric space.This definition is similar to those of topological pressure involving spanning sets.As an application,for C^(1+α)(α>0)diffeomorphisms of a compact manifold, we study the relationship between the measure-theoretic pressure and the periodic points. 展开更多
关键词 Ergodic measure Measure-theoretic pressure spanning set
原文传递
On the direct searches for non-smooth stochastic optimization problems
2
作者 Huang Tianyun 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2009年第4期889-898,共10页
Many difficult engineering problems cannot be solved by the conventional optimization techniques in practice. Direct searches that need no recourse to explicit derivatives are revived and become popular since the new ... Many difficult engineering problems cannot be solved by the conventional optimization techniques in practice. Direct searches that need no recourse to explicit derivatives are revived and become popular since the new century. In order to get a deep insight into this field, some notes on the direct searches for non-smooth optimization problems are made. The global convergence vs. local convergence and their influences on expected solutions for simulation-based stochastic optimization are pointed out. The sufficient and simple decrease criteria for step acceptance are analyzed, and why simple decrease is enough for globalization in direct searches is identified. The reason to introduce the positive spanning set and its usage in direct searches is explained. Other topics such as the generalization of direct searches to bound, linear and non-linear constraints are also briefly discussed. 展开更多
关键词 non-linear programming non-smooth optimization stochastic simulation direct searches positive spanning set convergence analysis pattern selection.
下载PDF
Ranks of Repeated-Root Constacyclic Code
3
作者 LI Hongju DING Jian TANG Yongsheng 《Wuhan University Journal of Natural Sciences》 CAS CSCD 2016年第5期453-460,共8页
By the discussion of division in F2m[u]/〈u4〉,the minimal spanning set and the rank of a(1+u+u2)-constacyclic code with an arbitrary length N=2en over F2m[u]/〈u4〉 are determined based on the factorization of(x... By the discussion of division in F2m[u]/〈u4〉,the minimal spanning set and the rank of a(1+u+u2)-constacyclic code with an arbitrary length N=2en over F2m[u]/〈u4〉 are determined based on the factorization of(xn-1) over F2m. 展开更多
关键词 constacyclic codes RANK the minimal spanning set
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部