drtoolbox

实现各阶本原多项式的小m序列的长生，通过改变本原多项式的生成矩阵可以产生想要的m序列的(Order to achieve the small-m primitive polynomial sequence longevity, by changing the primitive polynomial generator matrix m can produce the desired sequence)

calculate moy of the signal

说明：  在MATLAB上求解自适应动态规划，实现非线性模型的ADP算法(Solving adaptive dynamic programming on MATLAB)

这是一个模拟第3类模式地震波的matlab脚本。 This a collection of Matlab scripts that solve the antiplane (mode III) earthquake dynamic problem with slip-weakening friction, on a 1D fault embedded in a 2D homogeneous elastic unbounded medium. The problem is formulated as a boundary integral equation and the elastodynamic kernels are analytically derived in the spectral domain (spatial wavenumber). The method is explained e.g. by Morrysey and Geubelle (1997), and has been improved and extensively used by Nadia Lapusta, Alain Cochard, etc. (This is a Class 3 model simulation of seismic waves of matlab scripts. This a collection of Matlab scripts that solve the antiplane (mode III) earthquake dynamic problem with slip-weakening friction, on a 1D fault embedded in a 2D homogeneous elastic unbounded medium.The problem is formulated as a boundary integral equationand the elastodynamic kernels are analytically derived inthe spectral domain (spatial wavenumber). The method is explained eg by Morrysey and Geubelle (1997), and has been improved and extensively used by Nadia Lapusta, Alain Cochard, etc.)

实现聚类K均值算法： K均值算法：给定类的个数K，将n个对象分到K个类中去，使得类内对象之间的相似性最大，而类之间的相似性最小。 缺点：产生类的大小相差不会很大，对于脏数据很敏感。 改进的算法：k—medoids 方法。这儿选取一个对象叫做mediod来代替上面的中心 的作用，这样的一个medoid就标识了这个类。步骤： 1，任意选取K个对象作为medoids（O1,O2,…Oi…Ok）。 以下是循环的： 2，将余下的对象分到各个类中去（根据与medoid最相近的原则）； 3，对于每个类（Oi）中，顺序选取一个Or，计算用Or代替Oi后的消耗—E（Or）。选择E最小的那个Or来代替Oi。这样K个medoids就改变了，下面就再转到2。 4，这样循环直到K个medoids固定下来。 这种算法对于脏数据和异常数据不敏感，但计算量显然要比K均值要大，一般只适合小数据量。(achieving K-mean clustering algorithms : K-means algorithm : given the number of Class K, n will be assigned to target K to 000 category, making target category of the similarity between the largest category of the similarity between the smallest. Disadvantages : class size have no great difference for dirty data is very sensitive. Improved algorithms : k-medoids methods. Here a selection of objects called mediod to replace the center of the above, the logo on a medoid this category. Steps : 1, arbitrary selection of objects as K medoids (O1, O2, Ok ... ... Oi). Following is a cycle : 2, the remaining targets assigned to each category (in accordance with the closest medoid principle); 3, for each category (Oi), the order of selection of a Or, calculated Oi Or replace the consumption-E (Or))

Matlab交通仿真程序用于仿真交通红绿灯的设计！(Matlab traffic simulation program for the simulation of traffic lights design!)

关于信息恢复的程序。输入恢复类型、恢复向量导引和测度矩阵即可恢复出原向量。测度矩阵可以通过getmat.m文件生成。(With regard to the information recovery procedures. Enter recovery type, to restore vector guide and measure matrix can be restored to the original vector. The measurement matrix through getmat.m file generation.)

MATLAB Basic codes for finding mahanobis distance,gaussian,multivirate

精度颇高的转子临界转速及不平和响应算法，主要采用了传递矩阵法(High precision of the rotor critical speed and the uneven and response algorithms, mainly in the transfer matrix method)

脑电信号测度计算，复杂网络研究的不同之处在于首先从统计角度考察网络中大规模节点及其连接之间的性质，这些性质的不同意味着不同的网络内部结构，而网络内部结构的不同导致系统功能有所差异。(EEG signal )