ucf_content_transfer_tuning_guide1

MATLAB program for comparison of arrays

Matlab中的fsolve函数源代码。可用于解方程。(Matlab fsolve function of the source code )

fuzzy logic is a good controller

PDCCH的实现过程及其遇见的问题应该遇见的问题(PDCCH the realization of the process and the issue should be met to meet the problem of)

说明：  分数阶热传导工具箱可以用于求解分数阶微分方程中的热传导过程的求解，包含解析解与数值解的求解方式，含有显式，隐式和Crank–Nicolson求解方法。(The methods of solving models of heat conduction are described, namely analytical and numerical methods. In the case of numerical methods regards the finite difference method by using GL definition for the fractional time derivative. Implementation of these individual methods was realized in MATLAB. The two libraries of m-functions for the heat conduction model have been created, namely Heat Conduction Toolbox and Fractional Heat Conduction Toolbox.)

Generate 3D Gaussian filter

小波去噪小程序 matlab实现 自创 呵呵 与大家分享(a simple denoise program )

shortest path dijkstra algorithm

说明：  分支定界法（branch and bound）是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划，还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法，选择不同的分支变量和子问题进行分支。 对于两个变量的整数规划问题，使用网格的方法有时更为简单。 [1] 通常，把全部可行解空间反复地分割为越来越小的子集，称为分支；并且对每个子集内的解集计算一个目标下界（对于最小值问题），这称为定界。在每次分枝后，凡是界限超出已知可行解集目标值的那些子集不再进一步分枝，这样，许多子集可不予考虑，这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems. For integer programming problems with two variables, the grid method is sometimes simpler[ 1] Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)

基于柔度差算法实现结构的损伤识别，附算例的节点坐标和单元文件(Compliance difference algorithm for structural damage identification, with examples of the node coordinates and unit files)