搜索资源列表
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,
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
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
mymatlab
- For free space path loss, fc=1.5GHz (Carrier frequency) If we take different antenna gains such as 1.(Gt=1,Gr=1)and 2.(Gt=1,Gr=0.5)and 3.(Gt=0.5,Gr=0.5) When we reduce the antenna gains (i.e. the transmitting gain or the receiving gain) there is
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
Aver--Path--Length
- 一个很有用的计算网络中两节点的距离以及平均路径长度的程序，对网络分析很有用-A very computing network with a two-node distance and the average path length of program and very useful for network analysis
cluseter_test
- 演示了最大距离,最小距离,平均距离的分级聚类及其分类结果展示。-hierarchical clustering base on maximum distance,minumum distance and average distance.
RSSI_Matlab_Y
- 用matlab统计不同距离的RSSI值，画折线图，并最将各距离处平均值用最小二乘法拟合成3到5项多项式曲线-RSSI value of the matlab statistics at different distances, draw a line chart, and most average each distance with the least square method were fitted polynomial curve of 3-5
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.
DV_Hop_modify
- 针对基本无线传感器网络DV-Hop定位算法中，计算平均跳距时产生偏小误差的原因，提出了基于平均跳距修正的DV-Hop算法。改进算法中，引入信标节点个数比例、所有信标节点平均跳距的最大值以及所有信标节点平均跳距的平均值三个因子，并采用它们对平均跳距进行修正。通过Matlab软件对算法进行仿真验证，结果表明，改进后的 DV-Hop 算法有效降低了未知节点的定位误差，是一种可行的无线传感器网络节点定位解决方案。-DV-Hop localization algorithm for wireless se
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
The-parameters-of-complex-network
- 可以求出复杂网络中两节点间的距离以及平均路径长度，各节点的度及度的分布曲线，以及节点的聚类系数。-You can find out the distance and average path length between the two nodes in complex networks .you can also find out degree and degree distribution curve of each node, and the node clustering coeffic
localization-hopsize
- 根据硕士论文编写，在DV-hop基础上对平均每跳距离做了修正，效果比原始算法好的多。-According to the master s thesis writing, on the basis of DV- hop made a correction, the average jump distance effect is much better than the original algorithm.
idw
- IDW(Inverse Distance Weighted)是一种常用而简便的空间插值方法，它以插值点与样本点间的距离为权重进行加权平均，离插值点越近的样本点赋予的权重越大。-IDW (Inverse Distance Weighted) is a common and simple spatial interpolation method that the distance between the interpolation point and the sample point is weig
评价
- 对图像分割结果与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
- 计算复杂网络中的集聚系数 网络的平均集聚系数 平均距离 度分布 matlab编程实现(Matlab programming for calculating average coefficient Mean distance distribution of agglomeration coefficient in complex networks)
matlab代码
- 无线通信网络中的基站平均间距获取，增益获取，3db值等(Acquisition of average distance between base stations)