-
particlefiltering
说明: 一篇硕士论文,详细介绍了利用粒子滤波在无线传感器网络目标跟踪中的应用
基于粒子滤波的无线传感器网络目标跟踪算法的研究(A master' s thesis, detailing the use of particle filtering in wireless sensor network application of target tracking based on particle filtering for wireless sensor network target tracking algorithm)
- 2010-03-18 20:11:47下载
- 积分:1
-
Tetris-coded-by-c
简明易懂的C语言俄罗斯方块,编程语言C,源码,未编译,TC 通过。(Tetris: programmed by c, which is concise and simple, so it is an easy way to learn C with strengthening your capabiliy in 2D game. it is source code,and has been tested by TC)
- 2012-07-13 17:47:40下载
- 积分:1
-
dht11
说明: arduinoIDE中的DHT11库文件(DHT11 library file in arduinoide)
- 2020-06-03 14:57:04下载
- 积分:1
-
dwc_ble50combophy_tsmc40_databook
说明: dwc_ble50combophy_tsmc40_databook
- 2020-06-18 11:00:01下载
- 积分:1
-
ganshe
说明: 该程序可以实现平面波与球面波的干涉图案。(Interference pattern between plane wave and spherical wave can be realized.)
- 2020-06-18 15:40:01下载
- 积分:1
-
Java EJB简单例子
Java EJB简单例子,这是HelloWorldBean的Home接口,它是EJB对象的生成库,无状态会话(将在下一个实例中具体讲解)Bean,这个接口是客户端与EJB对象相互作用的中间途径,通过Client触发调用Bean方法:
try {
//取得初始化属性jndiContext,它是连接JNDI树的起始点
InitialContext jndiContext = new InitialContext(properties);
//取得Home对象的引用
Object ref = jndiContext.lookup("HelloWorldHome");
HelloWorldHome home = (HelloWorldHome)
PortableRemoteObject.narrow (ref, HelloWorldHome.class);
//用EJB生成库Home生成EJB对象
HelloWorld hello= home.create();
//调用EJB对象方法printHelloWorld(),EJB对象把调用委派给Bean
System.out.println (hello.printHelloWorld());
}
- 2022-07-20 22:16:54下载
- 积分:1
-
本次实验学习和掌握LabvIEW顺序结构的执行过程和使用方法
本次实验学习和掌握LabvIEW顺序结构的执行过程和使用方法-This experiment in order to learn and master the structure of LabvIEW implementation process and use
- 2022-06-15 21:47:58下载
- 积分:1
-
这个是Xilinx编程的源码,是Bristol大二时写的.
这个是Xilinx编程的源码,是Bristol大二时写的.-Xilinx is the programming source code, is sophomore at Bristol writes.
- 2022-11-23 21:55:04下载
- 积分:1
-
AR预测
ar模型进行预测,并求ar系数ar模型进行预测,并求ar系数(AR model is used to predict)
- 2017-09-29 15:23:14下载
- 积分:1
-
[输入]
图的顶点个数N,图中顶点之间的关系及起点A和终点B
[输出]
若A到B无路径,则输出“There is no path” 否则输出A到B路...
[输入]
图的顶点个数N,图中顶点之间的关系及起点A和终点B
[输出]
若A到B无路径,则输出“There is no path” 否则输出A到B路径上个顶点
[存储结构]
图采用邻接矩阵的方式存储。
[算法的基本思想]
采用广度优先搜索的方法,从顶点A开始,依次访问与A邻接的顶点VA1,VA2,...,VAK, 访问遍之后,若没有访问B,则继续访问与VA1邻接的顶点VA11,VA12,...,VA1M,再访问与VA2邻接顶点...,如此下去,直至找到B,最先到达B点的路径,一定是边数最少的路径。实现时采用队列记录被访问过的顶点。每次访问与队头顶点相邻接的顶点,然后将队头顶点从队列中删去。若队空,则说明到不存在通路。在访问顶点过程中,每次把当前顶点的序号作为与其邻接的未访问的顶点的前驱顶点记录下来,以便输出时回溯。
#include
int number //队列类型
typedef struct{
int q[20]
-[imported] map of the number of vertices N, Vertex map of the relationship between the starting point and end point A and B [output] if A to B without path then exporting "There is no path" Otherwise output A to B on the path vertices [storage structure] plan adopted adjacency matrix of storage. [Algorithm for the basic idea] BFS way from the vertex A, A visit followed with adjacent vertices VA1, VA2 ,..., VAK, visiting times, if not visit B, continue to visit with the VA1 adjacent vertices VA11, VA12 ,..., VA1M. VA2 and then
- 2022-01-25 22:50:29下载
- 积分:1