-
Gardner位同步分享所需要资料
接收端时间同步环仿真，包括插值滤波器、环路滤波器、GARDNER算法以及数字控制振荡器(Receiver time synchronization loop simulation, including interpolation filter, loop filter, GARDNER algorithm and digital controlled oscillator)
- 2018-03-12 14:45:35下载
- 积分：1
-
C#屏保程序- 文字滚动的屏幕保护
C#屏保程序- 文字滚动的屏幕保护，一个屏保程序，启动后显示文字滚动，可在代码中定义滚动文字的内容和速度，你可以通过本源码了解下如何实现窗体中的文字滚动，如何制作无标题栏和菜单栏的无边框窗体，如果导出成屏幕保护的运行模式等。
- 2022-02-01 03:12:55下载
- 积分：1
-
n factorial. Rar can help factorial number of recursive algorithm is based on th...
n的阶乘.rar 可以求数的阶乘 是以递归算法为基础的 对学习算法设计与-n factorial. Rar can help factorial number of recursive algorithm is based on the learning algorithm design and
- 2022-06-16 22:54:39下载
- 积分：1
-
异构网络
说明： 能够很好仿真异构网络，-是参考文献的较好选择，基于NS2.29(Be able to simulate heterogeneous networks)
- 2020-03-26 16:10:52下载
- 积分：1
-
Maximum likelihood estimation of Gaussian mixture model by expectation maximizat...
最大的高斯混合模型似然估计的期望最大化算法-Maximum likelihood estimation of Gaussian mixture model by expectation maximization algorithm
- 2022-01-26 02:09:49下载
- 积分：1
-
You need to download the general purpose toolbox and the signal toolbox.
Y...
You need to download the general purpose toolbox and the signal toolbox.
You need to unzip these toolboxes in your working directory, so that you have toolbox_general/ and toolbox_signal/ in your directory. -You need to download the general purpose toolbox and the signal toolbox.
You need to unzip these toolboxes in your working directory, so that you have toolbox_general/ and toolbox_signal/ in your directory.
- 2022-03-12 07:29:10下载
- 积分：1
-
svm-doc
适合初学者看的SVM资料,不过是英文的哦，，，，，(SVM to see information for beginners, but is in English Oh ,,,,,)
- 2010-12-21 17:48:17下载
- 积分：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
-
89346487three_level_SVPWM
SVPWM，NPC ，能很好的解决中点平衡的问题(SVPWM, NPC, can solve the problem of midpoint balance very well.)
- 2021-04-20 10:18:50下载
- 积分：1
-
Android版 Jchat聊天通信 源码分析
Android Jchat 开源项目源码+开发文档，jChat 是一个 Android 手机上基于位置的聊天软件，采用P2P通讯机制。里面含有了中英文的资料，详尽的源代码说明请下载后参考：“开源项目Jchat 编译以及源码分析.doc”文档。
- 2023-05-02 22:05:07下载
- 积分：1
