资源列表
genRayleighFading
- 输出产生瑞利信道衰落信号 只需输入采样率和多普勒频移大小-this function generates normalized rayleigh samples based on Inverse DFT The Generation of Correlated Rayleigh Random Variates by Inverse Discrete Fourier Transform
Time-frequency-distribution
- 时频分布在故障诊断中的应用，机械故障信号等-Time-frequency distribution in the fault diagnosis, mechanical fault signals
Maze
- 计算机专业课程数据结构中关于迷宫问题的源代码-Computer Course data structure source code on the maze
datastructure
- 几个学生成绩管理系统 由我班同学编写 1、提供身份验证，和使用系统的权限设置、判定。 2、用户能实现08电商5或6班同学各学期各科成绩的录入、编辑，数据保存在文件C:\student中， 3、用户能对学号或姓名，各学期、各学科成绩的查询。 4、用户能按各学科的平均分数排序输出 5、 用户能统计各科成绩的最高分、平均分的最高分以及总分的最高分并输出。 -Several student achievement management system written by a b
tanxin
- 北京大学程序在线评测系统(POJ)中关于贪心算法的一个解题程序-Peking University program online evaluation system (POJ), a greedy algorithm on problem solving process
Jdsvm
- 一个简单的支持向量机（SVM） matlab实现-a simple support vector machine realize used of matlab
conjugate-grade-method
- 有限元中基于共轭梯度法求解对称正定方程，可以很快的提高解题的速度！！一个比较简单的使用的代码！！希望对大家有用啊-Finite element conjugate gradient method based on symmetric positive definite equation, you can quickly increase the speed of problem solving! ! The use of a relatively simple code! ! Hope to u
leach
- 基于matlab的leach算法的原代码，在无线传感器网络簇头算法中有很大的优势。-The leach-based algorithm matlab source code, the cluster head algorithm for wireless sensor networks have great advantages.
LJJZ
- 显示图的邻接矩阵, 图的邻接表, 深度优先遍历, 广度优先遍历, 最小生成树PRIM算法, 最小生成树KRUSCAL算法,图的连通分量-Shows the adjacency matrix, adjacency table, depth-first traversal, breadth-first traversal, minimum spanning tree PRIM algorithm, minimum spanning tree KRUSCAL algorithm, graph conn
Mobile_user_localization
- Mobile User Localization
sdtq
- 雷达检测动目标的速度信息提取。雷达回波中的速度信息非常重要，此程序用于将雷达回波中的速度信息进行提取，以便于分析-The speed of moving target radar detection information extraction. The speed of the radar echo information is important, this program is used to the speed of the radar echoes to extract informa
Doubly-linked-list
- 双向链表，每个数据结点中都有两个指针，分别指向直接后继和直接前驱。可以很方便地访问它的前驱结点和后继结点-Doubly linked list, each data nodes have two pointers that point to a direct follow-up and direct precursors. Can easily access its predecessor node and successor node