使用模拟退火算法解0－1背包问题MATLAB源代码

POJ是北大在线测评系统这里有一些经典试题。P1061青蛙的约会是一道经典试题代码给出了Accepted算法。

平均因子分解法，适用于正定矩阵First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X=U U, where U is the square root matrix of X, and satisfies: (1) U U = X (2) U is upper triangular (that is, it has all zeros below the diagonal). It seems that the assumption of positive definiteness is necessary. Actually, it is "positive definite" which guarantees the existence of such kind of decomposition. -Average factor decomposition method applied to positive definite matrix First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X = UU, where U is the square root matrix of X, and satisfies: (1) UU = X (2) U is upper triangular (that is, it has all zeros below the diagonal). It seems that the assumption of positive definiteness is necessary. Actually, it is positive

计算作图的源程序-calculated mapping of the source

输入图像为灰度图像，使用方法：[累积值, 圆心, 圆半径] = CircularHough_Grd(灰度图像, 最小范围直径 最大范围直径]); 可以检测同一幅图像中多个圆。

通过采样的时间序列数据，滤去低频的确定性信号，获得零均值的有色噪声，应用BBR公式，获得高阶谱。冻结一些维数，就可以得到二维的曲线，即高阶谱切片，或称重构功率谱。本程序实现三维空间不同角度的切片，有动画功能。

粒子群算法虽然具有算法简单，寻优速度快等优点，但同时存在算法容易收敛，易陷入局部最优值等问题。采用遗传算法改进粒子群算法，通过选择、交叉和变异操作的引入，改进了算法性能，增强了算法的全局搜索能力。本案例研究了基于混合粒子群算法的TSP寻优算法。

Secant method with 2 points for non-linear equations in C

资源描述求两个输入序列的最长的公共子字符串的长度。子字符串中的所有字符在源字符串中必须相邻。 如字符串：21232523311324和字符串312123223445，他们的最长公共子字符串为21232，长度为5。

TOYFDTD版本1.0，使用的是计算电磁学的FDTD算法，带动态内存分配-TOYFDTD version 1.0, using the FDTD computational electromagnetics algorithm, with dynamic memory allocation

c拉格朗日插值函数-c Lagrange interpolation function