-
Sound-Wave
Matlab 模拟声波传数,包括基带调制、数字上变频、数字下变频、滤波、译码等(Matlab to simulate the sound wave number, including baseband modulation, digital frequency conversion, digital frequency conversion, filtering, decoding, etc)
- 2014-08-20 17:15:19下载
- 积分:1
-
jiaozuoye333333
kalman滤波与组合导航的课件(北京航空航天大学)及其实验数据和仿真程序,附有源码(kalman filtering with integrated navigation the courseware (Beijing University of Aeronautics and Astronautics) experimental data and simulation program, with source code)
- 2012-11-06 19:20:17下载
- 积分:1
-
WindReliability
计及储能的风电系统系统风险评估,参数齐全可直接使用(Risk assessment of wind power system considering energy storage)
- 2021-03-09 21:59:27下载
- 积分:1
-
Main
file for speech recognition
- 2010-05-27 05:46:56下载
- 积分:1
-
imagepanorama
Its a novel matlab program for image panorama building
- 2010-05-31 15:29:44下载
- 积分:1
-
hmmbox_3_2
HMMBOX, version 3.2, William Penny, Imperial College, Feb 1999
Matlab toolbox for Hidden Markov Models(HMMBOX, version 3.2, William Penny, Imperial College, Feb 1999 Matlab toolbox for Hidden Markov Model s)
- 2007-03-26 22:47:02下载
- 积分:1
-
Erlan B Capacity
Erlang B code, calculates system capacity against specific communication channels and user intensity.
- 2019-03-26 12:58:15下载
- 积分:1
-
pll-matlab
通信常用锁相环仿真-matlab格式-有简单注释。(Communications Common PLL simulation-matlab format- a simple comment.)
- 2010-01-24 10:07:02下载
- 积分:1
-
CEGUI
说明: cegui使用说明,初学者可以看看,对api的介绍(cegui cegui cegui )
- 2010-04-20 13:32:03下载
- 积分:1
-
Dijkstra
说明: 最短路径的Dijkstra算法程序。Dijkstra算法是典型最短路算法,用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展,直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解,但由于它遍历计算的节点很多,所以效率低。
Dijkstra算法是很有代表性的最短路算法,在很多专业课程中都作为基本内容有详细的介绍,如数据结构,图论,运筹学等等。
(The Dijkstra shortest path algorithm for the procedure. Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the end date be extended to. Dijkstra shortest path algorithm can arrive at the optimal solution, but because of its calculation of the node traversal, so inefficient. Dijkstra algorithm is very representative of the shortest path algorithm, in many professional courses in the basic content as described in detail, such as data structures, graph theory, operational research and so on.)
- 2008-11-26 22:27:45下载
- 积分:1