Buck-Boost DC-DC变换器中分叉与混沌问题的研究(Ⅰ)——建模与仿真

研究了电流控制型Buck-Boost变换器中的分叉与混沌问题. 首先, 对连续模式下的Buck-Boost变换器建立了离散数学模型, 在此基础上, 在输入电压E、参考电流Iref、电阻R、电感L和电容C等分叉参数作用下, 通过数值方法对Buck-Boost变换器中的分叉与混沌进行了详细的仿真研究. 仿真研究结果表明: Buck-Boost变换器具有丰富的非线性行为———分叉与混沌, 随着各个分叉参数的变化系统会遵循倍周期分叉的规律走向混沌.     

Efficient online schedulability tests for real-time systems

Many computer systems, such as those for open system environments or multimedia services, need an efficient schedulability test for online admission control of new jobs. Although various polynomial time schedulability tests have been proposed, they often fail to decide the schedulability of the system precisely when the system is heavily loaded. On the other hand, most precise schedulability tests proposed to date have a high complexity and may not be suitable for online tests. We present new efficient online schedulability tests for both the periodic process model [C. L. Liu et al., (1973)] and the multiframe process model [A. K. Mok et al., (1997)] in uniprocessor environments. The schedulability tests are shown to be more precise and efficient than any existing polynomial-time schedulability tests. Moreover, the tests can be done incrementally as each new task arrives at the system. Our proposed tests can also be used for the multiframe model where a task may have different computation times in different periods. We show the performance of the proposed schedulability tests in several simulation experiments.     

具有未知参数的混沌系统的有限时间滑模同步控制

针对带有未知参数和非线性输入的两个不同的混沌系统之间的同步问题进行研究. 提出一个相比于传统滑模面具有更快收敛速度的终端滑模面, 并结合自适应控制理论和滑模控制理论, 设计一个自适应滑模控制律, 使同步误差在有限时间内收敛到滑模面, 并沿滑模面在有限时间内收敛到零点, 最终实现两个不同的混沌系统之间的同步. 最后, 以带有不确定性和外部扰动的Lorenz 系统和Liu 系统为例进行数值仿真, 仿真结果表明, 同步误差在有限时间内收敛到零点, 从而验证了所设计控制律的有效性和可行性.     

一种混沌测量系统的设计与分析

为设计一种高灵敏度、高分辨率的测量系统，文中从混沌的原理出发，采用简单混沌信号测量电压信号的数学模型，研究了相应的电路实现方法，设计出了一套混沌测量系统，给出了具体电路、单元电路分析和实验结果。实验结果表明了利用混沌实现信号测量的可行性。     

混沌运动对初值敏感依赖的本质原因

以Lorenz系统、Chen、Lü系统和Rössler系统为例,研究了混沌吸引子形成的机理、结构特征以及混沌运动对初值敏感依赖的本质原因。指出,连续非线性动力学系统要产生混沌吸引子,至少要存在两种非线性运动模态,并在两种运动模态之间进行非严格周期地转换;相邻状态在同一运动模态中运动的逐渐分离,和在不同运动模态之间的不同时（或不同幅度）转换,导致了系统运动对初值的敏感依赖,这就是混沌运动的本质。     

Two ant-colony algorithms for minimizing total flowtime in permutation flowshops

The problem of scheduling in flowshops with the objective of minimizing total flowtime is studied. For solving the problem two ant-colony algorithms are proposed and analyzed. The first algorithm refers to some extent to ideas by Stuetzle [Stuetzle, T. (1998). An ant approach for the flow shop problem. In: Proceedings of the sixth European Congress on intelligent techniques and soft computing (EUFIT '98) (Vol. 3) (pp. 1560–1564). Aachen: Verlag Mainz] and Merkle and Middendorf [Merkle, D., & Middendorf, M. (2000). An ant algorithm with a new pheromone evaluation rule for total tardiness problems. In: Proceedings of the EvoWorkshops 2000, lecture notes in computer science 1803 (pp. 287–296). Berlin: Springer]. The second algorithm is newly developed. The proposed ant-colony algorithms have been applied to 90 benchmark problems taken from Taillard [Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64, 278–285]. A comparison of the solutions yielded by the ant-colony algorithms with the best heuristic solutions known for the benchmark problems up to now, as published in extensive studies by Liu and Reeves [Liu, J., & Reeves, C.R. (2001). Constructive and composite heuristic solutions to the P//ΣC_i scheduling problem. European Journal of Operational Research, 132, 439–452, and Rajendran and Ziegler [Rajendran, C., & Ziegler, H. (2004). Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research, 155, 426–438], shows that the presented ant-colony algorithms are better, on an average, than the heuristics analyzed by Liu and Reeves and Rajendran and Ziegler.     

Chaos control of a bounded 4D chaotic system

This paper is concerned with the problem of optimal and adaptive control for controlling chaos in a novel bounded four-dimensional (4D) chaotic system. This system can display hyperchaos, chaos, quasiperiodic and periodic behaviors, and may have a unique equilibrium, three equilibria and five equilibria for the different system parameters. An optimal control law is designed for the novel bounded chaotic system, based on the Pontryagin minimum principle. Furthermore, we propose Lyapunov stability conditions to control the new bounded 4D chaotic system with unknown parameters by a feedback control approach. Numerical simulations are presented to show the effectiveness of the proposed chaos control scheme.     

Automatic synthesis of uncertain models for linear circuit simulation: A polynomial chaos theory approach

A generalized and automated process for the evaluation of system uncertainty using computer simulation is presented. Wiener–Askey polynomial chaos and generalized polynomial chaos expansions along with Galerkin projections, are used to project a resistive companion system representation onto a stochastic space. Modifications to the resistive companion modeling method that allow for individual models to be produced independently from one another are presented. The results of the polynomial chaos system simulation are compared to Monte Carlo simulation results from PSPICE and C++. The comparison of the simulation results from the various methods demonstrates that polynomial chaos circuit simulation is accurate and advantageous. The algorithms and processes presented in this paper are the basis for the creation of a computer-aided design (CAD) simulator for linear networks containing uncertain parameters.     

Applications of type-2 fuzzy logic systems to forecasting of time-series

In this paper, we begin with a type-1 fuzzy logic system (FLS), trained with noisy data. We then demonstrate how information about the noise in the training data can be incorporated into a type-2 FLS, which can be used to obtain bounds within which the true (noisefree) output is likely to lie. We do this with the example of a one-step predictor for the Mackey–Glass chaotic time-series [M.C. Mackey, L. Glass, Oscillation and chaos in physiological control systems, Science 197 (1977) 287–280]. We also demonstrate how a type-2 FLS can be used to obtain better predictions than those obtained with a type-1 FLS.     

利用反馈方法控制Lü系统中的混沌

利用经典反馈法实现了Lü系统的混沌控制,并基于Lyapunov直接法和Routh-Hurwitz判据讨论受控Lü系统的混沌轨道达到渐进稳定时的条件,并给出理论上的证明。数值模拟进一步验证了经典反馈控制方法均可成功将Lü系统混沌运动轨道镇定到不稳定平衡点或不稳定周期轨道,即极限环上。     

分数阶超混沌Lorenz系统的数值求解及其动力学特性分析

采用预估-校正算法和Adomian分解算法求解分数阶超混沌Lorenz系统,并对比研究两种算法结果。从得到的吸引子和频谱结果来看,两种算法得到的结果比较一致,都可用于分数阶混沌系统数值求解。分析了系统的动力学特性和C0复杂度,实验结果表明分数阶Lorenz系统具有丰富的动力学特性,采用Adomian算法能够得到更小的系统产生混沌最小阶数,当参数变化时,系统的混沌范围更广。最后基于C0复杂度设计了一种有效的系统参数选取算法。为分数阶混沌系统应用提供了理论与实验基础。     

多自由度参数振动混沌控制方法研究

基于耦合倒立双摆模型,本文采用Liapunov-Floquet变换,将周期时变系统转化为时不变系统,并引入反馈和极点配置,对该多自由度系统做参数振动进行主动控制.对研究的系统结合单位脉冲响应进行了稳定性分析,并成功地应用于系统混沌控制.     

A note on “Rough set theory based on two universal sets and its applications” Knowledge-Based Systems 23 (2010) 110–115

In this paper, we point out that one assertion (Proposition 6.1 (1)) in a previous paper by Liu [G.L. Liu, Rough set theory based on two universal sets and its applications, Knowledge-Based Systems 23 (2) (2010) 110–115] is incorrect by a counterexample. And a correct result is given.     

Anti-synchronization of four-wing chaotic systems via sliding mode control

Sliding mode control is an important method used in nonlinear control systems. In robust control systems, the sliding mode control is often adopted due to its inherent advantages of easy realization, fast response and good transient performance as well as its insensitivity to parameter uncertainties and disturbances. In this paper, we derive new results based on the sliding mode control for the anti-synchronization of identical Qi three-dimensional (3D) four-wing chaotic systems (2008) and identical Liu 3D four-wing chaotic systems (2009). The stability results for the anti-synchronization schemes derived in this paper using sliding mode control (SMC) are established using Lyapunov stability theory. Since the Lyapunov exponents are not required for these calculations, the SMC method is very effective and convenient to achieve global chaos anti-synchronization of the identical Qi four-wing chaotic systems and identical Liu four-wing chaotic systems. Numerical simulations are shown to illustrate and validate the synchronization schemes derived in this paper.     

渐近跟踪鲁棒控制的混沌同步

对混沌系统同步控制中的控制器进行了研究,因其实际应用受限大等因素而要求系统具有较好的鲁棒性.把渐近跟踪作为系统同步的推广,从控制方法的角度设计一个混沌同步控制器,运用极点配置法求出控制器的增益参数并从控制理论上证明了该思路的可行性.通过对Lorenz系统的数值仿真试验,验证了该方法在控制混沌同步方面的有效性.为混沌控制中设计耐受性高的控制器提供了依据.     

基于DSP的APD方法同步混沌系统的实现

本文介绍了一种基于TI公司的C54x DSP实现APD同步方法的混沌设计方案.该方案采用改进的OCRML系统,它可以从混沌信号中很精确地分解出有用信号,适用于高质量的同步保密通信.     

对G．723．1高码率编码语音中进行压缩域信息隐藏的性能分析

近年来,基于混沌理论的保密通信和数据保密得到广泛、深入的研究,提出了许多基于混沌理论的混沌加密算法,但这些算法缺乏可靠的安全性和鲁棒性.本文在对文献[1]提出的一种在语音混沌保密通信过程中进行信息隐藏方案的分析中,通过对G.723.1高速率编码语音中适合进行压缩域信息隐藏的码位性能分析和仿真实验,进一步证明了文献[1]方案的有效性和安全性等特点.     

应用计算机仿真研究混沌及混沌同步

在混沌应用研究领域,计算机仿真方法是继数值分析法、Lyapunov指数分析法和真实实验法之后的另一个非常有效而实用的混沌研究方法。本文通过计算机仿真再现了Chua电路的混沌信号输出;实现了对两个Chua电路主动－被动混沌同步。仿真实验表明：（i)在研究电子学信号混沌系统的混沌同步问题时,仿真实验与真实实验有较好的对等性;;（ii）在仿真实验过程中,仿真方法对影响系统同步的因素（如噪声和系统参数变化等因素）能进行有较控制,较之真实实验,对系统的稳定性和鲁棒性问题能进行更准确的量化分析。     

混沌优化算法的性能分析

现代优化算法主要解决全局最优问题，其本质是概率性的．借鉴多种自然现象，人们提出了许多仿生、仿物算法，如禁忌搜索算法（TABU）、模拟退火（SAA）、遗传算法（GA）、进化策略（ES）、蚁群算法（ACA）等．利用混沌的遍历性进行优化搜索就是一种很有趣的研究思路，尤其对于虫口方程人们进行了许多研究，取得了一定的研究成果．但和普通的随机搜索算法相比，其性能之不足也很明显，主要体现在：混沌的遍历性不均匀，在边界处搜索密度高，远不如随机Monte Carlo搜索方法．这就从本质上决定了其搜索性能在普适性上与Monte Carlo算法有差距．仿真计算证实了这个结论．因此对于利用虫口方程进行的混沌优化研究需要谨慎采用．     

LSC Verification for UML Models with Unbounded Creation and Destruction

The approaches to automatic formal verification of UML models known up to now require a finite bound on the number of objects existing at each point in time. In [W. Damm, B. Westphal, Live and let die: LSC-based verification of UML-models, Science of of Computer Programming 55 (2005) 117–159] we have observed that the class of hardware systems with replicated components studied by McMillan [K.L. McMillan, A methodology for hardware verification using compositional model checking, Science of Computer Programming 37 (2000) 279–309] is equivalent to the class of systems where the only source of infiniteness is unbounded creation and destruction of objects, i.e. where all data-types except for object identities are finite. Exploiting the symmetry of UML models induced by objects being instances of classes, the restriction to finite bounds can be overcome applying [K.L. McMillan, A methodology for hardware verification using compositional model checking, Science of Computer Programming 37 (2000) 279–309].In this paper we report on experiences from an evaluation of this approach within the UML Verifi- cation Environment (UVE) [I. Schinz, T. Toben, C. Mrugalla and B. Westphal, The Rhapsody UML Verification Environment, in: J.R. Cuellar and Z. Liu, editors, Proceedings SEFM 2004 (2004), pp. 174–183], a state-of-the-art tool for formal verification of UML models using Live Sequence Charts (LSC) [W. Damm, D. Harel, LSCs: Breathing Life into Message Sequence Charts, Formal Methods in System Design 19 (2001) 45–80] for requirements specification.