ketuo

说明：  （1）应用9×9的窗口对上述图象进行随机抽样，共抽样200块子图象； （2）将所有子图象按列相接变成一个81维的行向量； （3）对所有200个行向量进行KL变换，求出其对应的协方差矩阵的特征向量和特征值，按降序排列特征值以及所对应的特征向量； （4）选择前40个最大特征值所对应的特征向量作为主元，将原图象块向这40个特征向量上投影，所获得的投影系数就是这个子块的特征向量。 （5）求出所有子块的特征向量。 ((1) the application of 9 × 9 window of these images at random, a total sample of 200 sub-image (2) all sub-images according to out-phase into a 81-dimensional row vector (3) all 200 lines for KL transform vector, derived its corresponding covariance matrix of eigenvectors and eigenvalues, in descending order by eigenvalue and the corresponding eigenvector (4) a choice to 40 corresponding to the largest eigenvalue eigenvector as the PCA, the original image block to the 40 feature vectors on the projection, the projection coefficients obtained by this sub-block eigenvector. (5) calculated for all sub-block eigenvector.)

希尔伯特-黄变换的代码，适用于分析非平稳信号(Hilbert-Huang Transform code applicable to the analysis of non-stationary signals)

Artificial Neural Network for classification of letter

最小二乘支持向量机分类预测,基于matlab的编程，实现预测分类(Least squares support vector machine classifier prediction matlab-based programming, forecasting classification)

adc 积分非线性与微分非线性及SNR matlab 代码(adc SNR inl and dnl test)

说明：  they are matlab code for evolutionary strategy (ES), (ES(1+1), ES(1,1),ES(mu,lambda),ES(mu+lambda), I hope they are useful for you

Using interpolation method and implied volatility to calculate barrier options

matlab counting用于计算一定环境内的积木数量(matlab counting)

最小费用最大流问题是经济学和管理学中的一类典型问题。在一个网络中每段路径都有“容量”和“费用”两个限制的条件下，此类问题的研究试图寻找出：流量从A到B，如何选择路径、分配经过路径的流量，可以达到所用的费用最小的要求。(Minimum cost maximum flow problem is economics and management in a class of typical problems. Each path in a network has the " capacity" and " costs" two limiting conditions, such problems of trying to find out: Flow from A to B, how to choose the path, the path of the flow through the distribution can be achieved The use of the minimum cost requirements.)

某自行车商店的仓库管理人员采取一种简单的订货策略,现有如下五种订货策略，试以150天进行仿真测试，选择一个使总费用最小的订货策略.(Inventory problems )