搜索资源列表
dvhop.rar
- 主要介绍了dvhop算法的源代码，先计算平均每跳的距离，再根据跳数求出锚节点与未知节点的距离，再用三边测量法求出未知节点坐标,Dvhop algorithm introduces the source code, to calculate the average distance of each jump, then jump a few calculated in accordance with anchor nodes and unknown distance from the node,
DEM内插 反距离加权平均算法
- DEM内插 反距离加权平均算法 DEM插值经常用到的算法-DEM interpolation inverse distance weighted average algorithm for DEM interpolation algorithms are often used
small-world
- 程序以WS小世界模型及其改进版（by Newman and Watts (1999a).）为基础建立网络模型，计算网络平均距离，验证“六度分割”理论-Procedures to WS small world model and its improved version (by Newman and Watts (1999a).)-Based networking model to calculate the average distance network, verify the " s
chxu
- 本程序用于测量增强语音与纯净语音的对数谱距离，用于语音增强。对数谱距离越小，表明增强语音与纯净语音越接近，增强语音质量越好；反之，则增强语音质量越差。-Calculates the average log-spectral distance between CLEAN and NOISY signals. Frames are 25ms long with 60 percent (15ms) overlap, hamming windowed. RS is the remove
BHR
- 该程序可用于对河床断面进行概化，在输入断面起点距、高程及水位后，就可以得到河床的平均河底高程、河宽以及水深等结果。-The program can be used to estimate cross-section of the river.After you input the distance, elevation and water level of the section, you can get the average river bed height, width and depth
R36clusterings
- function in R software to calculate 36 clusterings of a data matrix (clusterings are in columns), using hierarchical average, cosine, centroid and single linkages, pam and neural gas and applying the Euclidean distance to the data. Clusterings can
Swarm_Optimization_Algorithm_with_C
- 改进的粒子群算法--自适应粒子群算法，在普通的粒子群算法里面加入了熵和平均粒距的概念，收敛速度大大提高，用C实现-Improved particle swarm- adaptive particle swarm optimization, in which ordinary PSO joined the entropy and the concept of average distance, speed up the convergence, with the C implementation
LogSpectralDistance_LP
- 计算源信号和噪音之间的频谱差，用于噪音估计等。-Calculates the average log-spectral distance between CLEAN and NOISY signals
LinearDiscriminantAnalysis
- 提出了一种新的基于图像分块重构和线性判别分析相融合的方法，主要用于人脸识别。该方法通过计算两幅图像之间图 像块的重构均值误差，运用线性判别分析求出两幅图像降维后的欧式距离，融合重构误差和欧式距离计算这两幅图像之间的差别 程度。-A new block-based image reconstruction and the integration of linear discriminant analysis method is mainly used for face recognitio
New-Text-Document
- The program RANDOM_WALK_2D_PLOT plots the trajectories of one or more random walks. The program RANDOM_WALK_2D_SIMULATION plots averaged data for any number of random walks that each use the same number of steps. The data plotted is the average
cluseter_test
- 演示了最大距离,最小距离,平均距离的分级聚类及其分类结果展示。-hierarchical clustering base on maximum distance,minumum distance and average distance.
fcm_py
- fcm聚类算法的python实现。输出类内平均距离类间平均距离。-FCM clustering algorithm python realized. Output class average distance between class in the average distance.
ANTTSP
- TSP在MATLAB中的实现，生成优化路径和平均距离和最小距离图-TSP implemented in MATLAB, generating optimal path and the average distance and the minimum distance graph
SDV-Hop
- SDV-Hop算法的工作主要体现在对平均每跳距离做了二次修正。-SDV-Hop algorithm is mainly reflected in the average distance per hop secondary correction.
the-average-path-length
- 问题描述：平均路径长度是网络中另一个重要的特征度量，他是网络中所有节点对之间的平均最短距离。这里节点间的距离指的是从一个节点要经历的边的最小数目，其中所有节点之间的最大距离称为网络的直径。平均路径长度和直径衡量的是网络的传输性能与效率。平均路径长度的公式为 ，其中dij表示点i和j之间的最短距离（若dij不存在时，dij就不能加入，且分母要相应减1） 要求：输入邻接矩阵表示的图，计算其平均路径长度-Descr iption of the problem: the averag
SmallWorld
- 通过公式SW=（C/Crand）/（L/Lrand）求取复杂网络的小世界性系数。 注：其中聚类系数和平均距离都是直接调用工具包中的函数。-By the formula SW = (C/Crand)/(L/Lrand) to strike a small complex networks worldwide coefficients. Note: where clustering coefficient and average distance are called directly tool
Hierarchical-clustering
- 使用VC++对给出的数据分别进行均值聚类、平均距离聚类、最小距离聚类和最大距离聚类运算，进行分析比较。-VC++ use of the data presented were mean clustering, average distance clustering, minimum and maximum distances the cluster clustering operation, were analyzed and compared.
评价
- 对图像分割结果与groundtruth对比评价，并且可以计算三维重建后平均距离和表面最大距离(The results of image segmentation are compared with groundtruth, and the average distance and the maximum distance of the surface can be calculated)
matlab代码
- 无线通信网络中的基站平均间距获取，增益获取，3db值等(Acquisition of average distance between base stations)