butterworthBilinealfilters

径向基神经网络训练matlab程序,并画出预测数据和原数据的对比图。(RBF-BP neural network algorithm Matlab code, the procedures under the trained network , be mean square error, paint and forecast data and the original data in contrast to Fig. Hope useful)

This functions models the pression profile with height

说明：  最大类间方差法 最大类间方差法是由Otsu于1979年提出的，是引起了较多关注的阈值化方法。(Maximum between maximum between-class variance method variance method was proposed in 1979 by Otsu, is causing the threshold method more attention.)

cooperative communication

　Buck-Boost转换器转换周期轨道从混乱的状态,本文提出一种　　混沌控制方法通过改善电感电流和输出电压之间的关系。通过调整　　耦合强度,这种方法可以控制混沌周期2 Buck-Boost转换器,period-4,period-8轨道　　period-9轨道和周期3,时间6,不确定不稳定周期轨道(着)。(To transform the Buck-Boost converter the chaotic state to the periodic orbits, this paper proposes a chaotic control method by improving the correlation between the inductor current and the output voltage. By adjusting the coupling strength, this method can control the chaotic Buck-Boost converter to the period-2, period-4, period-8 orbits and the period-3, period-6, period-9 orbits, without determining the unstable periodic orbits (UPOs) in advance.)

A novel algorithm for sparse approximation in redundant dictionaries, called the M-Term Pursuit (MTP). This algorithm decomposes a signal into a linear combination of atoms that are selected in order to represent the main signal components.

本程序是信息论与编码课程中常见的一种编码方式，即算术编码。这是一种最基本的简单编码(Information theory and coding of this procedure is a common curriculum in the encoding that the arithmetic coding. This is a basic simple coding)

用matlab实现确定一个种子，然后检查它的近邻是否有相似性，把相似的都归到一个区域中。(Using matlab to determine a seed, and then checks whether its neighbors have similar similar property of a regional.)

Fixed-Point iteration(Function fixed_point(p0, N) approximates the solution of an equation f(x) = 0, rewritten in the form x = g(x), which is a sub-function the user has to enter. the call to the function fixed_point(p0, N) returns the root of the equation f(x),i.e. the fixed-point of g(x), if the procedure is successful or a sequence of iterates in case something goes wrong. p0 is the initial approximation and N the maximum number of iterations. If, after N iterations, condition |x(k)- x(k-1)| < tol is not satisfied, all iterated values will be displayed, accompanied by a message asking the user to either change p0 in case of divergence or enter another g(x) that does not lead to complex numbers arithmetics. Reasons for the program to go wrong are the divergence of iterates and/or appearance of complex numbers for example with functions involving sqrt(x) when one of the iterates is negative. )

ook modulation simulink