半群的混沌作用

引进了半群混沌作用的概念,证明了若半群5在紧致度量空间X上的连续作用满足拓扑可迁和周期点稠两个条件,则此作用满足对初值的敏感依赖性,另外也讨论了半群S在X的逆极限空间上诱导作用的混沌性问题。     

混沌粒子群神经网络在上证指数预测中的应用

上证指数预测是一个非常复杂的非线性问题,为了提高对上证指数预测的准确性,本文采用基于混沌粒子群(CPSO)算法对BP神经网络算法改进的方法来进行预测.BP神经网络算法目前已经应用到预测、聚类、分类等许多领域,取得了不少的成果.但自身也有明显的缺点,比如易陷入局部极小值、收敛速度慢等.用混沌粒子群算法改进BP神经网络算法的基本思想是用混沌粒子群算法优化BP神经网络算法的权值和阈值,在粒子群算法中加入混沌元素,提高粒子群算法的全局搜索能力.对上证指数预测的结果表明改进后的预测方法,具有更好的准确性.     

非线性0-1规划问题的混沌粒子群算法

针对非线性0-1规划问题,提出了一种混沌粒子群优化算法.该算法利用罚函数法将非线性0-1规划问题处理为无约束的0-1规划问题,引入了混沌策略来初始化种群,增加其多样性,为预测算法是否出现早熟现象,采用了适应度方差.数值实验表明,提出的算法是求解非线性0-1规划问题的一种有效且可行的全局优化算法.     

基于混沌粒子群算法的Tikhonov正则化参数选取

Tikhonov正则化方法是求解不适定问题最为有效的方法之一,而正则化参数的最优选取是其关键.本文将混沌粒子群优化算法与Tikhonov正则化方法相结合,基于Morozov偏差原理设计粒子群的适应度函数,利用混沌粒子群优化算法的优点,为正则化参数的选取提供了一条有效的途径.数值实验结果表明,本文方法能有效地处理不适定问题,是一种实用有效的方法.     

基于故障树和混沌粒子群算法的锻压机床故障诊断方法

锻压机床由于生产效率高和材料利用率高的特点,被广泛应用于各领域.然而,锻压机床发生故障时,其故障种类繁多、故障数据量大,所以对锻压机床故障源的快速、准确诊断较困难.针对该问题,文章提出一种将故障树分析法和混沌粒子群算法相融合的方法,对锻压机床的故障源进行故障诊断.该方法是先通过故障树分析法对锻压机床的故障进行分析从而得到故障模式及其故障概率,然后由得到的故障模式和已知的故障维修经验分析归纳出故障模式的学习样本,再根据得到的故障概率运用混沌粒子群算法的遍历性快速、准确地诊断出锻压机床发生故障的精确位置.文章提出的方法以锻压机床的伺服系统为例进行了故障诊断实验,将该实验结果与遗传算法、粒子群算法进行对比.实验结果表明,文章的算法在锻压机床伺服系统的故障诊断中准确度更高、速度更快.     

基于双混沌优化搜索的改进粒子群算法及应用

针对现有算法在智能电阻箱动态误差校正方面存在的收敛速度慢、计算精度低,且易进入“局部最优”的陷阱等缺点,展开对智能电阻箱动态示数校正过程的重构及设计,并对动态误差校正优化算法进行研究.在双混沌优化系统中添加扰动因子与指数自适应学习方式改进搜索策略;在粒子群算法中将惯性权重因子修正为自适应权重因子,将学习因子修正为异步线性学习因子以优化算法,进而提出一种改进的粒子群优化算法(AL-DCPSO).利用8个经典函数对算法性能进行测试后,将这种算法应用在某型号智能电阻箱动态误差校正的过程中,研究结果表明:改进后的算法具有更高的计算精度(达到0.001)与更强的寻优能力,且在优化过程中呈现出较强的自适应学习能力,计算过程较为稳定,鲁棒性有效提升,耗时在阈值范围内有所增加.其创新性在于将双混沌优化机制的优点与粒子群算法相结合,应用到智能电阻箱动态误差校正的过程中,对动态误差校正方法进行了一定拓展,为粒子群优化算法在具体实际优化过程中的关键参数选取与策略设计,有效提升算法优化性能提供了一些借鉴.     

群在分配格上的作用

本文将分配格的自同构群对分配格的作用推广成抽象的群对分配格的作用(即G-分配格),建立了G-有界分配格范畴和G-Priestley空间范畴的对偶等价性,并在此基础上刻画了G-同余关系的对偶以及G-分配格的次直不可约性和同余可换性。所得结论丰富了分配格、格群等代数理论。     

瞬时混沌神经网络的混沌动力学

首先利用"不可分意味着混沌"从理论上证明了一维瞬时混沌神经网络在一定的条件下按Li-Yorke意义是混沌的;特别地,进一步推出了混沌神经网络按Li-Yorke意义是混沌的充分条件,而这将从理论上证明Aihara等人通过数值计算所得结论;最后,为说明前面的结论给出了一个例子及其数值计算的结果。     

混沌经济学——混沌与分形

本文给出作为混沌经济学的数学基础的混沌与分形的简短介绍 .     

群代数作用遍历性的一点注记

证明了由自由群整数环上一类元素确定的代数作用的遍历性,计算了Heisenberg群因子中特定元素的Fuglede-Kadison行列式值.     

A Devaney Chaotic System Which Is Neither Distributively nor Topologically Chaotic

Weiss proved that Devaney chaos does not imply topological chaos and Oprocha pointed out that Devaney chaos does not imply distributional chaos. In this paper, by constructing a simple example which is Devaney chaotic but neither distributively nor topologically chaotic, we give a unified proof for the results of Weiss and Oprocha.     

Distinguishing labeling of group actions

Suppose Γ is a group acting on a set X. An r-labeling f:X→{1,2,…,r} of X is distinguishing (with respect to Γ) if the only label preserving permutation of X in Γ is the identity. The distinguishing number, D_Γ(X), of the action of Γ on X is the minimum r for which there is an r-labeling which is distinguishing. This paper investigates the relation between the cardinality of a set X and the distinguishing numbers of group actions on X. For a positive integer n, let D(n) be the set of distinguishing numbers of transitive group actions on a set X of cardinality n, i.e., D(n)={D_Γ(X):|X|=n and Γ acts transitively on X}. We prove that . Then we consider the problem of an arbitrary fixed group Γ acting on a large set. We prove that if for any action of Γ on a set Y, for each proper normal subgroup H of Γ, D_H(Y)≤2, then there is an integer n such that for any set X with |X|≥n, for any action of Γ on X with no fixed points, D_Γ(X)≤2.     

A non-fixed point theorem for Hamiltonian lie group actions

We prove that, under certain conditions, if a compact connected Lie group acts effectively on a closed manifold, then there is no fixed point. Because two of the main conditions are satisfied by any Hamiltonian action on a closed symplectic manifold, the theorem applies nicely to such actions. The method of proof, however, is cohomological; and so the result applies more generally.

     

Generalized group actions in a global setting

We study generalized group actions on differentiable manifolds in the Colombeau framework, extending previous work on flows of generalized vector fields and symmetry group analysis of generalized solutions. As an application, we analyze group invariant generalized functions in this setting.     

A Borsuk-Ulam Theorem for compact Lie group actions

Let G be a compact Lie group. Let X, Y be free G-spaces. In this paper, we consider the question of the existence of G-maps f : X → Y . As a consequence, we obtain a theorem about the existence of ℤ_p-coincidence points. *The author was supported by FAPESP of Brazil Grant 01/02226-9.     

算子空间上的左乘映射

Let X be a separable infinite dimensional Banach space and B(X) denote its operator algebra,the algebra of all bounded linear operators T : X → X.Define a left multiplication mapping LT : B(X) → B(X) by LT (V ) = T V,V ∈ B(X).We investigate the connections between hypercyclic and chaotic behaviors of the left multiplication mapping LT on B(X) and that of operator T on X.We obtain that LT is SOT-hypercyclic if and only if T satisfies the Hypercyclicity Criterion.If we define chaos on B(X) as SOT-hypercyclicity plus SOT-dense subset of periodic points,we also get that LT is chaotic if and only if T is chaotic in the sense of Devaney.     

A Note on a Chaotic but not S-S Chaotic Subshift

In this paper we prove that the minimal chaotic but not S-S chaotic subshifts are also uinquely ergodic and have zero topological entropy.     

Existence of a dense orbit and topological transitivity: When are they equivalent?

Topological transitivity and existence of a dense orbit are two notions which play an important role in every definition of chaos [2], [4]. Unfortunately, in the literature there are often misunderstandings (or even false statements) about their relationship. In this note we show that generally neither condition implies the other and then we give two propositions (Propositions1 and 2) for implication in either direction. This revised version was published online in June 2006 with corrections to the Cover Date.     

Automorphism group actions on trees

We study the situation when the automorphism group of a recursively saturated structure acts on an ?‐tree. The cases of (?, <) and models of Peano Arithmetic are central in the paper. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)