基于DSP的双精度浮点型伪随机序列发生器的设计

在现代工程实践中,伪随机序列广泛应用于信息安全、数字通信、密码学、自动控制等领域中。本文设计了一种基于TD-ERCS混沌系统和混沌序列均匀化普适算法的伪随机序列发生器;采用32位高性能浮点型数字信号处理芯片实现了IEEE754双精度浮点型标准的PRSG;DSPs与PC的通讯采用了USB2.0传输协议。依据美国国家标准与技术研究院所提出的伪随机序列性能指标,对迭代所产生的混沌伪随机序列进行了测试,结果表明该PRSG所产生的CPRS性能良好,为算法的硬件实现做了很好的前期验证。     

基于直接序列扩频的空域视频数字水印

利用直接序列扩频技术,提出一种应用在视频上的数字水印方案。水印嵌入过程是在空域里通过修改像素来完成,对每一个视频帧都采用相同的算法。水印提取是基于空域相关性原则的,过程的进行不需要原始视频序列。实验结果表明,该水印方案在压缩、过滤、帧删除、帧平均等有意或无意的攻击下都具有较高的鲁棒性。     

基于模式与熵的随机序列研究

本文从双色球开奖结果出发,探讨真随机序列中暗含的＂模式＂：真随机序列有时表现得并不那么＂随机＂。这是因为人们认为,随机应是无序的。事实证明,并非如此。另一方面,人为产生的伪随机序列,大多经过了消除重复的步骤以使序列本身较为＂随机＂——看起来是无序的。本文使用Mersenne Twister算法产生伪随机序列,测试这种人为因素对随机序列统计特性的影响。为了进一步研究＂无序＂序列与随机序列的差异,本文基于熵,提出了一种简便的伪随机数发生器。通过对有序序列进行次数可控的交换来逐步实现无序化。对无序化后的序列进行均匀性和图像加密测试。通过无序的方法产生的序列,其随机性在一定范围内是可以信赖的。     

基于Viterbi设计最大似然序列检测器

有记忆信号的观测值是相互关联的,传统检测方法不能达到最佳效果。本文提出一种基于维特比算法的最大似然序列检测器,Viterbi算法将ML序列检测器执行的网格路径搜索的数量减到最小,采用全并行方案,用FPGA作为硬件载体,从而获得更快的速度和更小的电路规模。     

一种挖掘加权最大频繁序列的新算法

由于其内在的计算复杂性,在密集型数据序列数据库中挖掘全部频繁项集往往非常困难,解决方案之一是挖掘最大频繁序列。传统的序列模式方法对满足最小支持度阈值的序列同等对待,但在真实数据库中不同的序列往往具有不同的重要程度。为解决上述问题,提出了一种挖掘加权最大频繁序列的新算法。该算法利用频繁项目出现的频率来计算频繁序列的权重,给出了频繁加权序列的定义,该定义的引入不仅可以找出较为重要的最大频繁序列,而且可以使挖掘结果同样具有反单调性,从能够加速剪枝,提高算法效率。实验结果表明,加权最大频繁序列算法是有效的。     

产业产出序列的逻辑函数分析

本文首先对产业成长过程作了一些基本描述，指出一个产业的产出序列不一定服从逻辑函数，如果产出序列服从逻辑函数，其也有可能包含有若干个子逻辑序列。其次，定义了辨识序列与波动序列，进而建立了F（K，b)与W（K,b)两个辨识一个产业的产出序列是否服从逻辑函数以及对其构成阶段加以区分并确定相应的逻辑参数的理论模型。最后，简单扼要地介绍了把有关模型应用于实际分析的程序与规则。     

金融时间序列的混沌识别

将非线性和混沌的理论和方法应用在金融时间序列的研究中，识别金融时间序列是否为混沌时间序列是研究者面临的一个首要的问题，各个学科领域根据所研究的具体对象发展出了不同的算法，这些算法对金融hen序列的研究有借鉴作用。然而，金融时间序列的小数据量与混合噪声的特征使得混沌识别更加困难．目前广为应用的金融时间序列的混沌识别方法是Gencay-Dechert法，替代数据法等，这些算法仍然处于发展完善中。     

基于时间序列线性拟合方法的时间序列层次聚类

本文利用一种有效的时间序列线性拟合方法。算法所选出的关键点是对时间序列的形态变化影响较大的点,将这些点依次连接实现时间序列的线性拟合。这种线性拟合算法在剔除了噪声的同时,能更精确的定位时间序列中的关键点。实验结果表明,该方法能更好的近似表示原时间序列。和已有的方法相比,该方法拟合后的时间序列和原时间序列之间的拟合误差更小。并且在该方法的基础上运用动态弯曲距离进行层次聚类得到了较好的结果。     

生物序列比对算法综述

随着生物信息学的快速发展,序列比对算法成为研究的热点问题。本文介绍序列比对算法的概念及研究,并针对几种常用的序列比对算法进行比较。同时也简单说明序列比对算法的改进方向。     

基于FPGA的视频图像控制器的设计

视频图像控制器方案是基于FPGA开发的,采用一片SDRAM作为缓存,在Altera FPGA上采用Verilog语言,通过在片内跨时钟缓存处理视频图像数据来实现的“基于SDRAM的显示控制器”。通过纯硬件算法,实现字符图像叠加,并对多画面叠加、半透明显示等特效的显示进行设计。整个设计以EP2C8Q208C8的视频显示系统作为硬件平台,通过OV7670摄像头实现视频数据的实时采集。     

基于混沌序列的粒子群算法

对标准PSO算法进行分析的基础上,针对PSO算法中的早熟收敛问题,提出了一种基于混沌序列的PSO算法（CPSO）。CPSO算法能够保证粒子种群的多样性,使粒子能够有效进行全局搜索;并以典型的基准优化问题进行了仿真实验,验证了CPSO的有效性。     

DNA序列数形表示的研究

DNA序列的数形表示是用数学方法和计算机处理方法分析生物分子序列首先要解决的问题。序列表示的优劣会对最终分析结果有直接的影响。本文介绍了现有几种DNA序列数形表示方法。     

Synthesizing antipodal chaotic waveforms

Chaotic waveforms are natural information carriers since a correspondence can be established between the symbolic dynamics of a chaotic oscillator and the symbols of a message. Message symbols can be efficiently encoded in a chaotic waveform by applying vanishingly small perturbations to an oscillator to guide its symbolic dynamics to follow a desired course. Recently, two chaotic hybrid dynamical systems were shown to have matched filters enabling robust reception of chaotic communication waveforms in the presence of noise. The first of these, the exact shift oscillator, produces waveforms with desirable properties similar to antipodal signaling, but a physical implementation may be difficult to control using small perturbations. The second oscillator, the exact folded-band oscillator, produces less optimal waveforms but is more easily controlled. Here we introduce a method for generating waveforms of the exact shift oscillator by summing waveforms from a bank of easily controlled exact folded-band oscillators. We show that any solution of the exact shift oscillator can be so constructed using only three folded-band oscillators. Thus, this scheme allows us to realize the advantages of both chaotic systems while overcoming their individual disadvantages, thereby enabling practical chaos communications.     

数字水印提取的迭代学习辨识方法

针对结合混沌映射和多重混合的数字图像水印嵌入及提取问题,提出利用迭代学习辨识算法提取水印图像的方案。该方案将水印掩盖于混沌系统的参数中,以迭代学习算法重建原始水印图像。实验表明,运用所提出的迭代学习辨识算法能够从含水印图像中提取出完整的水印图像,给出的测试结果验证了学习算法抵抗常见几何攻击的能力。     

Synchronization of chaotic systems with unknown parameters using adaptive passivity-based control

This paper investigates the problem of complete synchronization of chaotic systems with unknown parameters. An adaptive control scheme based on a feedback passivity approach is proposed. The convergence of the synchronization error is guaranteed. The unified chaotic and hyperchaotic Lü systems are taken as illustrative examples. The feasibility and effectiveness of the proposed scheme are demonstrated through numerical simulations.     

Chaotic synchronization based on neural filter

Because of the high sensitivity of chaotic systems to their initial conditions, synchronization of chaotic systems with uncertain parameters has been a challenging problem especially in noisy environment. Since synchronization of the transmitter and receiver systems involves recursive estimation, recursive nonlinear filters are called for and the extended Kalman (EKF) filter and unscented Kalman (UKF) filter have been applied. However, such suboptimal filters incur high synchronization errors and provide no capacity for uncertain environment, which motivated the use of the neural filter for chaotic synchronization in this paper. The neural filter, which is a recurrent neural network, can approximate the minimum-variance to any degree. Furthermore, the neural filter can adapt to a uncertain environment without online filter weight adjustment, which is computationally efficient. Numerical experiments show that the chaotic synchronization scheme based on the neural filter outperforms those based on EKF and UKF by a large margin.     

Design of a model-free adaptive sliding mode control to synchronize chaotic fractional-order systems with input saturation: An application in secure communications

In this work, a model-free adaptive sliding mode control (ASMC) methodology is proposed for synchronization of chaotic fractional-order systems (FOSs) with input saturation. Based on the frequency distributed model and the non-integer version of the Lyapunov stability theorem, a model-free ASMC method is designed to overcome the chaotic behavior of the FOSs. The control inputs are free from the nonlinear-linear dynamical terms of the system because of utilizing the boundedness feature of the states of chaotic FOSs. Moreover, a new medical image encryption scheme is tentatively proposed according to our synchronization method, and its effectiveness is verified by numerical simulations. Furthermore, the performance and security analyses are given to confirm the superiority of the proposed encryption scheme, including statistical analysis, key space analysis, differential attack analysis, and time performance analysis.     

Finite-time multi-switching synchronization behavior for multiple chaotic systems with network transmission mode

By considering network transmission mode, this paper addresses the finite-time multi-switching synchronization problem for two kinds of multiple chaotic systems. For multiple same-order chaotic systems, we construct the general switching rules and analyze the existence of switching cases. The presented schemes guarantee the states of each derive system to be finite-timely synchronized with the desired states of every respond system in the different transmission paths and switching sequences. For multiple different order chaotic systems, we analyze a special multi-switching hybrid synchronization behavior, where part of the states are completely synchronized and the others belong to combination synchronization. Moveover, the easily verifiable criterion is derived for such synchronization. Finally, numerical examples are given to show the effectiveness of the presented theoretical results.     

An efficient simulation of the fractional chaotic system and its synchronization

The computational complexity of the numerical simulation of fractional chaotic system and its synchronization control is O(N²) compared with O(N) for integer chaotic system, where N is step number and O is the computational complexity. In this paper, we propose optimizing methods to solve fractional chaotic systems, including equal-weight memory principle, improved equal-weight memory principle, chaotic combination and fractional chaotic precomputing operator. Numerical examples show that the combination of these algorithms can simulate fractional chaotic system and synchronize the fractional master and slave systems accurately. The presented algorithms for simulation and synchronization of fractional chaotic system are up to 1.82 and 1.75 times faster than the original implementation respectively.     

Q-learning solution for optimal consensus control of discrete-time multiagent systems using reinforcement learning

This paper investigates a Q-learning scheme for the optimal consensus control of discrete-time multiagent systems. The Q-learning algorithm is conducted by reinforcement learning (RL) using system data instead of system dynamics information. In the multiagent systems, the agents are interacted with each other and at least one agent can communicate with the leader directly, which is described by an algebraic graph structure. The objective is to make all the agents achieve synchronization with leader and make the performance indices reach Nash equilibrium. On one hand, the solutions of the optimal consensus control for multiagent systems are acquired by solving the coupled Hamilton–Jacobi–Bellman (HJB) equation. However, it is difficult to get analytical solutions directly of the discrete-time HJB equation. On the other hand, accurate mathematical models of most systems in real world are hard to be obtained. To overcome these difficulties, Q-learning algorithm is developed using system data rather than the accurate system model. We formulate performance index and corresponding Bellman equation of each agent i. Then, the Q-function Bellman equation is acquired on the basis of Q-function. Policy iteration is adopted to calculate the optimal control iteratively, and least square (LS) method is employed to motivate the implementation process. Stability analysis of proposed Q-learning algorithm for multiagent systems by policy iteration is given. Two simulation examples are experimented to verify the effectiveness of the proposed scheme.