搜索资源列表
VANET
- 车辆自组织网络 重点是路由算法的设计思路 从文献分析到选题及实验验证的一个整体研究方法思路的智能交通的作者个人报告-The self-organizing network of vehicle is the design idea of routing algorithm From the literature analysis to the topic and experimental verification of a holistic approach to the idea of
beqnj
- 预报误差法参数辨识-松弛的思想，一种噪声辅助数据分析方法,基于混沌的模拟退火算法。- Prediction Error Method for Parameter Identification- the idea of relaxation, A noise auxiliary data analysis method, Chaos-based simulated annealing algorithm.
ns834
- 内含心电信号数据及运用MATLAB写的源代码，预报误差法参数辨识-松弛的思想，最小二乘回归分析算法。- ECG data and includes source code written in MATLAB, Prediction Error Method for Parameter Identification- the idea of relaxation, Least-squares regression analysis algorithm.
p71_fzerotx
- 实现方程数值解法的函数是fzero，介绍其算法思想(The function of numerical solution of equation is fzero, and its algorithm idea is introduced)
Jsteg
- 基于DCT的jsteg图像隐写及分析算法，MATLAB实现。 JSteg的算法主要思想是将秘密消息嵌入在量化后的DCT系数的最低比特位上，但对原始值为O、1的DCT系数不进行嵌入。提取秘密消息时，只需将载密图像中不等于0、l的量化DcT系数的LSB取出即可。(The main idea of the JSteg algorithm is to embed secret messages in the lowest bit of the quantized DCT coefficients, b
Floyd算法程序及PPT讲解
- 使用MATLAB运行，输入距离矩阵，即可得到任意两点之间最短路。采用Floyd算法思想。(Run with MATLAB, enter the distance matrix, you can get the shortest line between any two points. Using the idea of Floyd algorithm.)
ISODATA
- ISODATA聚类算法，使用C++代码来实现，对Haberman的生存数据数据进行聚类, 改变初始参数观察结果变化，然后使用OPENGL将聚类结果可视化输出，最后对结果加以分析。(According to the basic idea of ISODATA algorithm flow chart of ISODATA algorithm, and implemented using C++ code, clustered survival data on Haberman data, chan
排序算法比较
- 1． 掌握各种排序的基本思想。 2． 掌握各种排序方法的算法实现。 3． 掌握各种排序方法的优劣分析及花费的时间的计算。 4． 掌握各种排序方法所适应的不同场合。(1. master the basic idea of sorting. 2. master various sorting methods of the algorithm. 3., grasp the advantages and disadvantages of various sorting methods and
Floyd算法介绍
- 介绍了FLoyd算法的思想和实现。还有在游戏中的应用(The idea and implementation of FLoyd algorithm are introduced. And the applications in the game)
kMeans
- 实现聚类，预测数据，在教育行业十分有帮助(The basic idea of KMeans algorithm is that the initial random given K cluster centers, according to the nearest neighbor principle, the sample points are divided into different clusters. Then, the centroid of each cluster is comp
knn所涉及
- KNN是通过测量不同特征值之间的距离进行分类。它的的思路是：如果一个样本在特征空间中的k个最相似(即特征空间中最邻近)的样本中的大多数属于某一个类别，则该样本也属于这个类别。K通常是不大于20的整数。KNN算法中，所选择的邻居都是已经正确分类的对象。该方法在定类决策上只依据最邻近的一个或者几个样本的类别来决定待分样本所属的类别。(NN is classified by measuring the distance between the different eigenvalues. It is
sha1
- SHA1会产生一个160位的消息摘要。该算法经过加密专家多年来的发展和改进已日益完善，并被广泛使用。该算法的思想是接收一段明文，然后以一种不可逆的方式将它转换成一段（通常更小）密文，也可以简单的理解为取一串输入码（称为预映射或信息），并把它们转化为长度较短、位数固定的输出序列即散列值（也称为信息摘要或信息认证代码）的过程。(SHA1 generates a 160 bit message digest. The algorithm has been developed and improved
Example of DE
- 使用差分进化算法计算一个简单的求最小值的问题，方便学习和理解差分进化算法的思想(Using differential evolution algorithm to solve a simple minimum problem, it is easy to learn and understand the idea of differential evolution algorithm)
voxel
- 三维voxelFast and low memory cost, colour indexed voxel. In exemple a 3-D density map (with original dot inclosed). Original idea voxel.m (1023) but completly new algorithm.(Fast and low memory cost, colour indexed voxel. In exemple a 3-D dens
源代码
- 大数据应用中基于支配点的mlcss算法设计与实现，程序中设计了三条字符串，查找他们之间的最长公共子序列。相对于传统的动态规划法，基于支配点思想具有更加高效的效率。(The design and implementation of mlcss algorithm based on dominant point in large data application, three strings are designed in the program to find the longest common
yichuan
- 它是通过选择淘汰，突然变异，基因遗传等规律产生适应环境变化的优良物种的一种算法。遗传算法是根据生物进化思想而启发得出的一种全局优化算法。此程序就是用来求最优解的，从而得出了全局最短距离。(It is an algorithm for generating good species that adapt to environmental changes by selection, elimination, sudden variation, and genetic inheritance. Gen
FCM聚类算法介绍
- FCM算法是一种基于划分的聚类算法，它的思想就是使得被划分到同一簇的对象之间相似度最大，而不同簇之间的相似度最小。(FCM algorithm is a kind of clustering algorithm based on division. Its idea is to make the objects that are divided into the same cluster have the highest similarity, and the similarity among
adaboost
- 其核心思想是针对同一个训练集训练不同的分类器(弱分类器)，然后把这些弱分类器集合起来，构成一个更强的最终分类器(强分类器)。其算法本身是通过改变数据分布来实现的(Adaboost as an iterative algorithm which core idea is to train several different weak classifiers for the same dataset and then collect them together to form a stronger
knnimplementation
- 自己编写的KNN算法，不用工具包就可实现。kNN算法的核心思想是如果一个样本在特征空间中的k个最相邻的样本中的大多数属于某一个类别，则该样本也属于这个类别，并具有这个类别上样本的特性.(The core idea of the kNN algorithm is that if the majority of the k most neighboring samples of a sample in the feature space belong to a particular category
RFID
- 阐述算法的原理，详细介绍了RFID的功能，介绍了防碰撞算法的思想。(Expounds the principle of the algorithm, introduces the function of RFID, and introduces the idea of anti-collision algorithm)