-
ert3
ereeetet...which finds erettt
- 2010-05-18 01:21:31下载
- 积分:1
-
GPS_MIMU-embedded-navigation
GPS_MIMU嵌入式组合导航关键技术研究_唐康华(GPS_MIMU embedded navigation key technology research _ Tangkang Hua)
- 2013-12-19 20:26:45下载
- 积分:1
-
waveleseriestthreshoding
使用matlab的小波分解和重建函数对24位的ADC采样数据进行小波变换和去噪,去噪使用阈值算法,阈值的选取具体使用了6种方法进行对比,对于不同信号其效果是不同的!把去噪后的信号和原始信号放在一个图中,使用不同颜色的曲线进行对比,效果可以很直观的表现。(Using matlab wavelet decomposition and reconstruction of the function for 24-bit ADC sampling data wavelet transform and denoising, denoising using the threshold algorithm, the threshold selecting specific methods used six kinds of contrast, the effect for different signals is different The! After the denoising signal and the original signal on a map using different colors to compare curves, the effect can be very intuitive performance.)
- 2009-11-05 15:39:12下载
- 积分:1
-
OIPF-T1-R2-Specification-Volume-2-Media-Formats-v
OIPF specification for multimedia formats valid for HbbTV applications
- 2015-02-10 03:55:53下载
- 积分:1
-
particalfilter
关于用粒子滤波实现目标跟踪的MATLAB程序。(Target tracking code using particle filter in MATLAB.)
- 2010-06-14 16:41:07下载
- 积分:1
-
Non-numerical-parallel-algorithms-Ga
说明: 非数值并行算法:遗传算法,遗传算法的一个教程,很适合初学者(Non-numerical parallel algorithms: Genetic algorithm, genetic algorithm tutorial, very suitable for beginners)
- 2011-03-25 18:45:21下载
- 积分:1
-
Satellite
模拟进行卫星基站间的通信控制,包括申请信道资源、进行信道管理等(Analog control satellite communication between base stations, including the application of channel resources, channel management conjugate ngn)
- 2014-01-21 15:32:20下载
- 积分:1
-
dijikstra
For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
- 2012-04-12 21:01:48下载
- 积分:1
-
kmanes2
k means clustering algorithm new 2 cluster
- 2013-11-04 05:00:43下载
- 积分:1
-
System-identification
关于系统辨识和自适应分析的ppt教学分析,通俗易懂。(Ppt teaching analysis on system identification and adaptive analysis, easy to understand.)
- 2015-01-07 14:19:32下载
- 积分:1