Chaotic synchronization with filter based on wavelet transformation

A kind of chaotic synchronization method is presented in the paper. In the transmitter, part signals are transformed by wavelet and the detail information is removed. In the receiver, the component with low frequency is reconstructed and discrete feedback is used, we show that synchronization of two identical structure chaotic systems is attained. The effect of feedback on chaotic synchronization is discussed. Using the synchronous method, the transmitting signal is transported in compressible way, system resource is saved, the component with high frequency is filtered and the effect of disturbance on synchronization is reduced. The synchronization method is illustrated by numerical simulation experiment.     

Borel measures in consonant spaces

A topology on a set X is called consonant if the Scott topology of the lattice is compactly generated; equivalently, if the upper Kuratowski topology and the co-compact topology on closed sets of X coincide. It is proved that every completely regular consonant space is a Prohorov space, and that every first countable regular consonant space is hereditarily Baire. If X is metrizable separable and co-analytic, then X is consonant if and only if X is Polish. Finally, we prove that every pseudocompact topological group which is consonant is compact. Several problems of Dolecki, Greco and Lechicki, of Nogura and Shakmatov, are solved.     

Banach空间有界线性算子强连续双半群

本文在Ｂａｎａｃｈ空间上研究单参数有界线性算子族－强连续双半群。     

基于改进二进制蚁群算法的函数优化

对于函数优化问题,传统蚁群算法存在着算法实现较难,求解速度慢,需要记忆功能,不容易与其他算法结合等问题,而已有二进制蚁群算法也存在着迭代次数过多,收敛速度慢等问题.借鉴二进制蚁群算法思想,将解空间直接二进制离散化求解,实验证明该算法在处理一元及多元函数优化方面均有较好的表现,通过对几个函数的测试(包括一元和多元),结果表明该改进算法具有较好的稳定性和收敛速度,算法性能良好.     

不确定条件下双目标组批生产的交货期设置研究

交货期是调度方法的函数,因而具有不确定性.研究变批量、变批次、变生产能力下,单阶段、双目标有条件相容组批的交货期设置问题,将它转化为订单投放策略和调度模式研究.建立了一个基于目标的双目标订单投放策略数学模型.采用目标序列优先方法进行双目标求解,用两种调度模式求出区间值,进行最优交货期逼近.模式1:松弛掉产品加工约束条件,基于负荷考虑、给出离散生产模式下订单完工率最大的订单排序算法,算法综合考虑了任务紧急程度、可调度性、重要度和流程时间最短四个方面,得到区间的一个端点.模式2是有条件相容的启发式组批调度算法,即通过聚类计算将订单安排问题转化为多队列调度问题,将新来订单的投放转化为某个队列的插单和批量分割问题,不同队列中批的投产顺序由批中优先级最高的订单决定,并在能力约束下进行批量分割计算,得到区间的另一个端点,结合流程可靠性求出区间.实例证明,模式2的交货期设置小,订单完工率和生产率高.     

Milnor方图中的w-凝聚性

整环R称为ω-凝聚整环,是指R的每个有限型理想是有限表现型的.本文证明了ω-凝聚整环是v-凝聚整环,且若(RDTF,M)是Milnor方图,则在Ⅰ型情形,R是ω-凝聚整环当且仅当D和T都是ω-整环,且T_M是赋值环;对于Ⅱ-型情形,R是ω-凝聚整环当且仅当D是域,[F:D]<∞,M是R的有限型理想,T是ω-凝聚整环,且R_M是凝聚整环.     

微分周形式与稀疏微分结式

代数周(Chow)形式和代数结式是代数几何的基本概念,同时还是消去理论的强大工具.一个自然的想法是在微分代数几何中发展相应的周形式和结式理论.但是由于微分结构的复杂性,在本文的研究工作之前,微分结式只有部分结果,而微分周形式与稀疏微分结式理论一直没有得到发展.本文的主要结果包括:第一,发展一般(generic)情形的微分相交理论,作为应用,证明一般情形的微分维数猜想.第二,初步建立微分周形式理论.对不可约微分代数簇定义微分周形式并证明其基本性质,特别地,给出微分周形式的Poisson分解公式,引入微分代数簇的主微分次数这一不变量并证明一类微分代数闭链的周簇和周坐标的存在性.作为应用,首次严格定义微分结式,证明其基本性质.第三,初步建立稀疏微分结式理论.引入Laurent微分本性系统的概念,定义稀疏微分结式,证明其基本性质,特别地,引入微分环面簇的概念,给出稀疏微分结式阶数和次数界的估计,并基于此给出计算稀疏微分结式的单指数时间算法.     

A novel control system simulation modeling method considering the real hardware platform and the software structure

During the realization of a control algorithm for the practical motor driver system, simulation is an important procedure before the algorithm is implanted into the DSP chip. In most circumstances, the simulation is done before the algorithm is realized, which is simulated under the condition of continuous control system. However, the simulation neglects the effect of the discrete system caused by the software structure, which the algorithm in DSP is triggered by the events trigger interrupt. Moreover, the model is complicated and cannot reflect the real hardware and the pipelined algorithm. Furthermore, the accuracy and running time of the simulation model are controlled by the simulation step setting. In this paper, a novel discrete simulation model is realized and introduced to consider the effect of both hardware and software and to reduce the running time with a considerable accuracy. The unification of the parameters is also considered in the model to make the system more efficient. The result reveals that the proposed method reflects the effect of both the real hardware and the software, which form a close loop between the simulation and algorithm realization. The simulation runtime is reduced, while the accuracy is unchanged, and it is suitable for the simulation of high-speed motor driver system.     

油田注水系统拓扑布局优化的混合遗传算法

以投资最小为目标函数,建立了注水系统拓扑布局优化数学模型.根据模型特点,将优化问题分为两层,分别采用遗传算法和非线性优化方法进行求解.并对遗传算法的操作过程进行了改进,调整了适应函数,改进了交叉和变异操作,结合了模拟退火算法,在操作过程中使约束条件得到满足,减少了不可行解的产生,使遗传算法的优化性能得到了提高.优化算例说明了该方法的有效性.     

两类带有确定潜伏期的SEIS传染病模型的分析

通过研究两类带有确定潜伏期的SEIS传染病模型,发现对种群的常数输入和指数输入会使疾病的传播过程产生本质的差异．对于带有常数输入的情形,找到了地方病平衡点存在及局部渐近稳定的阈值,证明了地方病平衡点存在时一定局部渐近稳定,并且疾病一致持续存在．对于带有指数输入的情形,发现地方病平衡点当潜伏期充分小时是局部渐近稳定的,当潜伏期充分大时是不稳定的．     

An approximate solution for linear boundary-value problems with slowly varying coefficients

In this paper, an approximate closed-form solution for linear boundary-value problems with slowly varying coefficient matrices is obtained. The derivation of the approximate solution is based on the freezing technique, which is commonly used in analyzing the stability of slowly varying initial-value problems as well as solving them. The error between the approximate and the exact solutions is given, and an upper bound on the norm of the error is obtained. This upper bound is proportional to the rate of change of the coefficient matrix of the boundary-value problem. The proposed approximate solution is obtained for a two-point boundary-value problem and is compared to its solution obtained numerically. Good agreement is observed between the approximate and the numerical solutions, when the rate of change of the coefficient matrix is small.     

A general result in stochastic optimal control of nonlinear discrete-time systems with quadratic performance criteria

It is known that the optimal controller for a linear dynamic system disturbed by additive, independently distributed in time, not necessarily Gaussian, noise is a linear function of the state variables if the performance criterion is the expected value of a quadratic form. This result is known to hold also when the noise is Gaussian and is multiplied by a linear function of the state and/or control variables.In this paper it is proved that the optimal controller for a discrete-time linear dynamic system with quadratic performance criterion is a linear function of the state variables when the additive random vector is a nonlinear function of the state and/or control variables and not necessarily Gaussian noise which is independently distributed in time, provided only that the mean value of the random vector is zero (there is no loss of generality in assuming this) and the covariance matrix of the random vector is a quadratic function of the state and/or control variables. The above-mentioned known results emerge as special cases and certain nonlinear other special cases are exhibited.     

Optimality equations and inequalities in a class of risk-sensitive average cost Markov decision chains

This note concerns controlled Markov chains on a denumerable sate space. The performance of a control policy is measured by the risk-sensitive average criterion, and it is assumed that (a) the simultaneous Doeblin condition holds, and (b) the system is communicating under the action of each stationary policy. If the cost function is bounded below, it is established that the optimal average cost is characterized by an optimality inequality, and it is to shown that, even for bounded costs, such an inequality may be strict at every state. Also, for a nonnegative cost function with compact support, the existence an uniqueness of bounded solutions of the optimality equation is proved, and an example is provided to show that such a conclusion generally fails when the cost is negative at some state.     

Strong conjugation actions induced by flags of exact Borel subalgebras

Let A be a quasi-hereditary algebra with a strong exact Borel subalgebra. It is proved that for any standard semisimple subalgebra T there exists an exact Borel subalgebra B of A such that T is a maximal semisimple subalgebra of B. It is shown that the maximal length of flags of exact Borel subalgebras of A is the difference of the radium and the rank of Grothendic group of A plus 2. The number of conjugation-classes of exact Borel subalgebras is 1 if and only if A is basic; the number is 2 if and only if A is semisimple. For all other cases, this number is 0 or no less than 3. Furthermore, it is shown that all the exact Borel subalgebras are idempotent-conjugate to each other, that is, for any exact Borel subalgebras B and C of A, there exists an idempotent e of A, and an invertible element u of A, such that eBe = u^-1eCeu.     

An adaptive cellular updating scheme for the continuous–discontinuous cellular automaton method

The updating scheme is very important for cellular automata, which costs the vast majority of CPU time of the whole calculating process and dramatically influences the convergence rate, and the traditional node sequence scheme is often ineffective. Aimed at this issue, based on the unbalanced nodal force, an adaptive updating scheme for continuous–discontinuous cellular automaton method is proposed in this paper. The cell whose unbalanced force is maximum is the first updating cell, and the next one is its neighbors whose unbalanced force is also maximum in all remain neighbors, and do the updating operation according to this scheme until the updating for all cells is finished. Theory and convergence of the present scheme is studied, then we can get the maximum calculating efficiency, and the computational expanse can be greatly improved. Some examples by different iteration schemes are shown to demonstrate that the present scheme is efficient and time saving.     

两种随机存贮管理模型的建立和求解

建立了仓库容量有限条件下单品种、多品种允许缺货的随机存贮模型.采用连续的时间变量更合理地描述了问题,简化了模型的建立.模型的求解是一个以分段的平均损失费用函数作为目标的带约束最优化问题.针对题目中的具体数据对随机量送货滞后时间的密度函数进行了估计,解出了单品种、多品种条件下最优订货点的值和存贮方案.通过分情况讨论把单品种存贮模型推广为多品种(m种)存贮模型,论证了目标函数的独立变量为2m-1个,使模型更加清晰、求解方便.类比控制论中的相关理论提出了一定条件下多品种存贮的最优性原理,给出了证明,指出该原理简化模型和验证模型求解结果的作用.讨论了销售速率具有随机性时的存贮模型,实际当中调整修正订货点的方法,以及仓库最大存贮量的一种预测办法.最后指出了模型的优缺点.     

覆盖下近似算子的拓扑性质

在不限制U为有限论域的情况下,研究了覆盖下近似算子XL和CL的拓扑性质。证明了覆盖下近似算子XL是内部算子,而且由XL生成的拓扑TXL为包含由覆盖C本身作为子基生成的拓扑TC的最小Alexandrov拓扑。特别地,当U为有限论域时,TXL=TC.然而,覆盖下近似算子CL不是内部算子。当覆盖C为某拓扑的基时,CL是内部算子,且此时由CL生成的拓扑TCL与TC是同一个拓扑。若进一步要求U为有限论域,则TCL=TXL=TC,进而CL=XL.     

弱空间式Locale

空间式locale范畴SLoc是locale范畴Loc的余反射满子范畴,但对locale乘积不封闭．本文引入弱空间式locale,证明弱空间式locale范畴WSloc为范畴Loc的余反射满子范畴,且对locale秉积封闭．还证明了一个locale A是空间式的当且仅当它的枝映射localeN(A)是弱空间式的;一个空问式locale的每一个子locale都是空间式的当且仅当它的每一个子locale是弱空间式的．最后,证明了弱空间式性在定向函子下保持不变．     

连续区间数的中位算子及其灵敏度分析

研究决策信息以区间数形式给出的方案决策问题。考虑到区间数非均匀分布的特点,为避免区间极端值在区间数确定中产生较大误差,本文将中位数概念运用到区间数的确定上,提出OIP(Ordered Interval Point)有序中位算子。取单位区间单调函数(BUM函数)为二分之一所表示的值为权重,将区间数确定为一个实数,并研究算子单调性和有界性的初等运算性质。通过比较OIP算子与COWA算子对态度参数和区间长度的反应灵敏度,获得了在一定条件下OIP算子对态度参数反应更稳健,对区间长度反应更灵敏的结论。最后用算例证明该算子的可行性和有效性。     

Mathematical models of innovation diffusion with stage structure

Mathematical models with stage structures are proposed to describe the process of awareness, evaluation and decision-making. First, a system of ordinary differential equations is presented that incorporates the awareness stage and the decision-making stage. If the adoption rate is bilinear and imitations are dominant, we find a threshold above which innovation diffusion is successful. Further, if the adoption rate has a higher nonlinearity, it is shown that there exist bistable equilibria and a region such that an innovation diffusion is successful inside and is unsuccessful outside. Secondly, a model with a time delay is proposed that includes an evaluation stage of a product. It is proved that the system exhibits stability switches. The bifurcation direction of equilibria is also discussed.