粒子滤波实例

扫雷游戏 用c语言编写的扫雷游戏,这是程序的源代码-Minesweeper game with the c language de-mining game, which is the source code

通过使用opencv、scipy和python检测运动人前额信号的微小rgb变化，实现用视频估计心率。(Implemented estimating heart rate using video by detecting the minute RGB changes in signals from the forehead of a moving person using OpenCV, Scipy and Python)

lingo matlab 全套代码 可直接运行的，仅供参考使用(Lingo matlab full set of code can be run directly for reference purposes only)

仿真杂波中目标检测并计算虚警概率与检测概率，比较固定门限与CFAR的区别(1(a): Simulation of target detection 1(b): Evaluation of detection rate and false alarm rate 2(a): Simulation of CFAR detection 2(b): Compare the performance of fix thresholding and CFAR)

说明：  用matlab实现DEM三维成像，考虑了阴影和高程的效应(Using matlab to realize DEM three-dimensional imaging, considering the effects of shadows and elevation)

说明：  神泣4.0客户端登录器，玩私服用的阿时打算打(shaiya is a very good game i like it very much)

对已经存在的Accsess数据库表添加新字段并复值(right Accsess already existing database table and add a new field of Complex)

主要是建立考虑温度场与立场耦合下的直齿轮动力学模型。通过龙格库塔法求解，得出一系列的动态特性。(The dynamic model of spur gear is mainly established considering the coupling of temperature field and position. A series of dynamic characteristics are obtained by using the runge-kutta method.)

包含了InSAR信号仿真，InSAR噪声仿真，InSAR配准和相位解缠等InSAR处理过程程序(It includes InSAR signal simulation, InSAR noise simulation, InSAR registration and phase unwrapping, and other InSAR processing procedures)

[输入] 图的顶点个数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