搜索资源列表
chuanre_23
- 这是另一个相关程序，求解传热系数的基本思想相同，只是温度的检测点不同。-This is another procedure, solving heat transfer coefficient of the same basic idea, but the detection of temperature difference.
Gauss_Seidel_iterative
- 迭代法是解线性代数方程组的另一类方法，特别适用于解大型稀疏线性方程组。它的基本思想是针对求解问题预先设计好某种迭代格式，从而产生求解问题的近似解迭代序列，在迭代序列收敛于精确解的情况下，按精度要求取某个迭代值作为问题解的近似值。迭代法具有原始系数举证始终不变，算法简单，编写程序较方便，所需存储单元较少的优点。-iterative method was the linear algebraic equations of the other methods, particularly applica
EMDprogram
- EMD主程序，将EMD的核心思想应用Matlab程序实现，其他相关程序可再联系本人。-EMD main program, the core idea EMD Matlab program. other related procedures can be linked himself.
kalman-filter-simulation-tools
- In 1960, R.E. Kalman published his famous paper describing a recursive solution to the discretedata linear filtering problem [Kalman60]. Since that time, due in large part to advances in digital computing, the Kalman filter has been the subje
weightpercent
- Returns weighted percentiles of a sample given the weight vector w ％ The idea is to give more emphasis in some examples of data as compared to ％ others by giving more weight. For example, we could give lower weights to ％ the outliers. ％ The
GA.通过遗传算法的思想来解决
- 本MATLAB例程，为通过遗传算法的思想来解决f(x)=x*sin(10pi*x)+2.0,-1<=x<=2的最大值问题。,The MATLAB routines for the adoption of the idea of genetic algorithm to solve f (x) = x* sin (10pi* x)+ 2.0,-1
hurstcaculate.rar
- hurst指数估计 This function does dispersional analysis on a data series, then does a Matlab polyfit to a log-log plot to estimate the Hurst exponent of the series. This algorithm is far faster than a full-blown implementation of Hurst s
newXFDTD
- 利用传输线模型，结合时域有限差分法（FDTD）思想，分析传输线终端响应-Using transmission line model, combined with finite difference time domain (FDTD) idea of the transmission line terminal response
cell-automatic-matlab-procedure
- 基于元胞自动机(CA)法的晶粒生长模型， 元胞自动机的基本思想 -Based on Cellular Automata (CA) Law grain growth model, cellular automata basic idea
CFD
- 计算流体力学（CFD）的基本思想。 里面有一个matlab编写的模拟例子-Computational Fluid Dynamics (CFD) There is a basic idea of the preparation of the simulated example matlab
kmean
- 包括K-均值聚类算法的思想介绍，kmeans的MATLAB代码，c语言代码、c++代码。-Including the K-means clustering algorithm introduced the idea, kmeans of MATLAB code, c language code, c++ code.
dark_channel_verify
- verify the idea of Single Image Haze removal Using Dark Channel prior, which is the best paper of CVPR in 2009 conference.
ssim_index
- Zhou Wang proposed a new idea of Structural Similarity Index (SSIM )for image quality measurement based on the assumption that the HVS is highly adapted to extract structural information from the viewing field. The Mean Structural Similarity Index (M
flody
- 图论算法 求SAP矩阵的基本思想是图的最短路的问题。 由于铁路的运输费用与线路的长度不是线性关系，必须对铁路网做一些预处理才能套用图的标准最短算法。 -SAP matrix graph theory algorithm for getting the basic idea is to map the shortest path problem. Since the railway transport costs and the length of line is not a line
MATLAB(ca)
- 简单介绍了用工具MATLAB编写元胞自动机，其中有简单的设计思路，源代码。-A brief written using MATLAB tools of cellular automata, which have a simple design idea, the source code.
work
- 运用遗传算法的思想，通过MATLAB及遗传算法工具箱，实现了函数最值的运算求解！-The idea of the use of genetic algorithms, and genetic algorithm through MATLAB toolbox to achieve the most value of the function of computing to solve!
MATLAB-newbox
- 采用面向对象的基本思想,MATLAB/SIMULINK环境下,开发出一个基于MATLAB的化工单元操作工具箱(ChET)并以此工具箱为基础进行了化工过程模拟的尝试。-Adopt the basic idea of object-oriented, MATLAB/SIMULINK environment, the development of a MATLAB-based toolbox of chemical unit operation (ChET) and to the toolbox as
MATLAB_Seam_Carving
- Using the idea from Seam Carving for Content-Aware Image Resizing, the codes enables a selected image to resize without having distortion of important object in the image file.-Using the idea from Seam Carving for Content-Aware Image Resizing, the
facerecognizeonPCA
- 像的许多个空间中的一个。不管子空间的具体形式如何，这种方法用于图像识别的基本思想 都是一样的，首先选择一个合适的子空间，图像将被投影到这个子空间上，然后利用对图像 的这种投影间的某种度量来确定图像间的相似度，最常见的就是各种距离度量。-Like much of a space. Regardless of the specific sub-space form, this method has been applied to image recognition are the same
Bisection
- he basic idea of the method of bisection is to start with an initial interval, [a0,b0], that is chosen so that f(a0)f(b0) < 0. (This guarantees that there is at least one root of the function f(x) within the initial interval.) We then iteratively