基于DSP的足球机器人控制电路设计

数字带通滤波器的设计过程。共3个源程序。其中，dos.cpp为带通FIR的源程序，其中的滤波器阶数n，滤波器的低频fln，滤波器的高频fhn，窗函数w，可以按照自己的要求改变。这里采用的是汉宁窗。主函数main.cpp实现输入与fir的h(n)的卷积，输出结果Y(n)，并将其存储在y.txt中。最后，graphics.cpp从y.txt读取数据，再由语句画出波形，可以清楚地看出计算结果是否正确，并进行比较。-digital band-pass filter design process. A total of three sources. Among them, dos.cpp FIR bandpass to the source, the filter order n, the low-frequency filter FLN, the high-frequency filter fhn, window function w, in accordance with the requirements change. Here is the Hanning window. The main function main.cpp achieve the input and fir h (n) convolution, the output Y (n), and store them in y.txt China. Finally, graphics.cpp y.txt read data from and then draw waveform statement, we can clearly see whether calculations are correct, and comparisons.

这个文件是用来模拟QDPSK的误码率的。结果被写入一个txt文件，然后您可以将其导入matlab。

牛顿插值方法的计算机实现程序-Newton interpolation method of computer procedures

用c语言编辑数据库中的最小函数依赖， 求属性集X（XU）关于U上的函数依赖集F 的闭包XF+

DBSCAN算法的Java实现  DBSCAN是一种基于密度的聚类算法，它的基本原理就是给定两个参数，ξ和minp，其中 ξ可以理解为半径，算法将在这个半径内查找样本，minp是一个以ξ为半径查找到的样本个数n的限制条件，只要n>=minp，查找到的样本点就是核心样本点

One of the world-wide cooperative computing tasks is the "Grand Internet Mersenne Prime Search" -- GIMPS -- striving to find ever-larger prime numbers by examining a particular category of such numbers. A Mersenne number is defined as a number of the form (2p–1), where p is a prime number -- a number divisible only by one and itself. (A number that can be divided by numbers other than itself and one are called "composite" numbers, and each of these can be uniquely represented by the prime numbers that can be multiplied together to generate the composite number — referred to as its prime factors.) Initially it looks as though the Mersenne numbers are all primes. Prime Corresponding Mersenne Number 2 4–1 = 3 -- prime 3 8–1 = 7

dijkstra求最短路:最短路问题是重要的最优化问题之一，它不仅可以直接应用于解决实际的许多问题，如管道铺设、线路安排、厂区布局、设备更新等，而且经常被作为一个基本工 具，用于解决其他问题。对于两点间的距离大于或者等于0的问题而言，目前公认的最好的方法是由Dijkstra于1959年提出来的。

资源描述本程序采用C++编写五子棋小游戏，算法简单易懂，易操作

双截面算法的C++实现。该算法是一种无约束优化方法。它仅适用于一个变量；

this to find out the shortest path for various nodes-this is to find out the shortest path for various nodes