维特比译码

通过对二价谱的编程分析，对信号处理里面采样率和采样长度对fft的影响做了一针见血地分析-By bivalent programming spectrum analysis, signal processing inside the sample rate and sample length on the impact of fft analysis done sharply

波音747飞机运动空间六自由度仿真模型-Simulink程序.rar波音747飞机运动空间六自由度仿真模型-Simulink程序.rar波音747飞机运动空间六自由度仿真模型-Simulink程序.rar

复合形法的不等式约束优化。其中的主程序是通用的，只要修改自己的目标函数和约束条件即可。-Complex method of inequality constrained optimization. One of the main program is commonly used, as long as the amendments to its own objective function and constraint conditions.

大约有10种排序方法，如堆排序、快速排序、归并排序、插入排序、外壳排序、选择排序、早泡排序、线性排序、地址选择排序和基排序。我自己提出了一种简化的快速排序。-about 10 species of sequencing methods, such as heap sort, quick sort, merge, in order to insert sequencing, shell sort, select, in order of ranking as foam, linear ordering, sequencing and address choice-based ranking. I propose a simplified Quick Sort.

Fuzzy聚类工具箱，含4种评价方式，内有文档及注释-FuzzyClusteringToolbox

使用C语言对图形进行读取和处理，在过程中将bmp（位图）文件进行读取和存储的小小程序

动态规划算法解决行商问题 VC-dynamic programming algorithm to solve the problem VC Cohong

奇数N 阶魔方阵问题： 奇数N 阶魔方阵的构造规则如下： 1、在第一行的正中间填入1； 2、如果左上角能够移动，则往左上角填入后继的数；如果左上角不 能移动，则顺移到该列最下方左边的一列中最靠近该列的位置； 3、如果左上角不能移动，同时在该列位置的最下方左边最靠近的位 置处也不能填入数，则往该位置的上一行的最右边的位置处填入 后继数； 4、每次尽可能地往左上角填数，如果发现左上角已经填满了数，则 从当前填的数的位置下方填上后继数。 要求： 无。 输入： 用户从键盘任意输入一个正奇数。 输出： 打印出该魔方阵。-odd N bands Demon Lineup : N-odd magic Lineup Construction Rules are as follows : 1, the first line is the middle of a preference; Two, if the upper left corner to Mobile, the successor to fill in the upper left; If the upper left corner, unable to move, with the move out of the bottom of the left one of the closest out of position; three, if the upper left corner, unable to move, while in the position shown in the bottom left nearest location Department has not entered a few, to the position of the party on the right side of the positions filled successor; 4, each possible to fill the upper left corner, if fill the upper left corner, has found a few, from the current fill several positions to fill in the bottom subsequent few. Requ

*   *   To approximate I = integral ( ( f(x) dx ) ) from a to b:*   *   INPUT:   endpoints a, b; integer n.**   OUTPUT:  an array R. ( R(2,n) is the approximation to I. )**   R is computed by rows; only 2 rows saved in storage   

给出了线性方程组的CG法、Gauss_Seidel、SOR、Jacobi、fem求解，-Linear equations given the CG method, Gauss_Seidel, SOR, Jacobi, fem solution