搜索资源列表
经典4阶R-K法
- 经典4阶R-K法（可以计算运行时间）-classic four bands R-K (running time can be calculated)
16位CRC校验_Modbus标准算法
- CRC校验 1、循环校验码（CRC码）：是数据通信领域中最常用的一种差错校验码，其特征是信息 字段和校验字段的长度可以任意选定。 2、生成CRC码的基本原理：任意一个由二进制位串组成的代码都可以和一个系数仅 为‘0’和‘1’取值的多项式一一对应。例如：代码1010111对应的多项式 为x6+x4+x2+x+1，而多项式为x5+x3+x2+x+1对应的代码101111。 3、CRC码集选择的原则：若设码字长度为N，信息字段为K位，校验字
Discrete_Cosine_and_Sine_Transforms
- 继 Discrete Cosine Transform: Algorithms, Advantages, Applications (K. R. Rao and P. Yip) 之后的一本关于离散余弦变换(DCT)的快速实现算法的最新专著. 本书第五章“Integer Discrete Cosine/Sine Transforms”关于DCT整数近似实现写的非常详细和精彩, 很方便大家编程实现. 值得一提的是本书的第一作者Vladimir Britanak 一直在从事DCT, 尤其是改进的离散余
R-KDDA
- 核直接线性判别方法:图像及高维复杂数据模式识别的利器！内有方法开发的相关文档说明！经典！-The matlab functions implement the methods presented in the paper [TNN_KDDA02.pdf] Juwei Lu, K.N. Plataniotis, and A.N. Venetsanopoulos, "Face Recognition Using Kernel Direct Discriminant Anal
numerical_analysis_homework
- (有源代码)数值分析作业,本文主要包括两个部分,第一部分是常微分方程(ODE)的三个实验题,第二部分是有关的拓展讨论,包括高阶常微分的求解和边值问题的求解(BVP).文中的算法和算例都是基于Matlab计算的.ODE问题从刚性(STIFFNESS)来看分为非刚性的问题和刚性的问题,刚性问题(如大系数的VDP方程)用通常的方法如ODE45来求解,效率会很低,用ODE15S等,则效率会高多了.而通常的非刚性问题,用ODE45来求解会有很好的效果.从阶次来看可以分为高阶微分方程和一阶常微分方程,高阶的
LocalK-meansAlgorithmforColourImageQuantization.r
- Local K-means Algorithm for Colour Image Quantization
kruskal1
- kruskal算法求解最小生成树 K r u s k a l算法每次选择n- 1条边，所使用的贪婪准则是：从剩下的边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选取的边若产生环路则不可能形成一棵生成树。K r u s k a l算法分e 步，其中e 是网络中边的数目。按耗费递增的顺序来考虑这e 条边，每次考虑一条边。当考虑某条边时，若将其加入到已选边的集合中会出现环路，则将其抛弃，否则，将它选入。-kruskal
R-Opt-Lin-Kernighan
- Lin-Kernighan的R-Opt算法。主要思想是CLK，小规模的TSP可以在很短的时间内都到最优解。-Lin-Kernighan algorithm for the R-Opt. The main idea is CLK, small-scale TSP can be in a very short period of time have gone to the optimal solution.
R-KandNewton
- 这是我今天刚做的高数常用的两个算法:一是用Newton迭代法求根号值 二是用4级-4阶的R-K法解此方程y/=-y ,初值y(0)=1. 同时有些常见的编程技巧. -This is what I did today, just a high number of commonly used two algorithms: One is Roots with Newton iteration number value another one is 4-4 bands RK Solving t
DP_1_5_SI
- this the four generator system of the Padhiyar book the simulation is well performed for the load gvn in the K.R. Padhiyar buk. The student those are referring this model can have this system for the study purpose-this is the four generato
DP_1_5_SI_mdl
- this the simulation of the four generator system which is based on the K.r.Padhiyar book the load flow data and the line data is taken from this buk..... the students those are new in the simulation in matlab can refer this simulation and wor
r
- 结合颜色和纹理的改进K均值遥感图像聚类 传统k均值聚类效果更好-Combination of color and texture remote sensing images to improve K means clustering
vgg
- 多视点几何学中从P中提取出K,R例如P = K*R*[eye(3) -t]以及从两个相机矩阵得到单应矩阵-Multiview geometry extracted from the P K, R such as P = K* R* [eye (3)-t]
r-K
- 数值分析中R-K迭代算法，用于矩阵的求解问题-RK iterative algorithm in numerical analysis, solving problems for the matrix
svm4
- -s svm类型：SVM设置类型(默认0) 0 -- C-SVC 1 --v-SVC 2 – 一类SVM 3 -- e -SVR 4 -- v-SVR -t 核函数类型：核函数设置类型(默认2) 0 – 线性：u v 1 – 多项式：(r*u v + coef0)^degree 2 – RBF函数：exp(-r|u-v|^2) 3 –sigmoid：tanh(r*u v + coef0) -d degree
kruskal
- K r u s k a l算法每次选择n- 1条边，所使用的贪婪准则是：从剩下的边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选取的边若产生环路则不可能形成一棵生成树-K ruskal algorithm each time you select n-1 edges, using criteria of greed: from the left side, select a loop with no minimum spend has been selected to
r-k
- 利用已知的四阶R-K方法求解高阶常微分方程-Using the known four order R-K method to solve high order ordinary differential equation
kmeansK
- KMEANSK Performs K-means clustering given a list of feature vectors and k The argument k indicates the number of clusters you want the data to be divided into. data_vecs (N*R) is the set of R dimensional feature vectors for N data points. E
KRT_from_P
- 此程序可从投影矩阵中分解出摄像机的内外参数(K、R、T)，效果很不错。需要包含opencv头文件。-The program can decompose interior and exterior parameters(K,R,T) from a camera s projection matrix. Strong performace has been demonstrated. What you only have to do is to contain relative OPENCV hea
R-K-and-Adams
- 常微分方程初值问题的数值解法 本程序主要采用经典四阶的R-K方法和四阶Adams预测-校正方法来求解常微分方程的数值解。 -Numerical Solution of Ordinary Differential Problems of this procedure using the classical fourth-order RK method and fourth-order Adams prediction- correction method to solve the nume