搜索资源列表
root
- 一段关于二叉树的小程序，包含了二叉树的插入、删除、清空，更新等操作-Small paragraph on binary programs, including the binary tree insertion, deletion, emptied, update and other operations
power-spectrum-estimation
- 分别使用MVDR、Root-Music和ESPRIT三种方法对信号频率估计进行仿真实验，其中噪声为复正弦加性白噪声，给出正弦信号频率的估计值。-Using MVDR, Root- Music and ESPRIT three methods to estimate the signal frequency simulation experiment respectively, which is suitable for complex sinusoidal additive white nois
gotbbaha
- 用牛顿迭代法求一个方程在某一个点处的的根,方程的系数可任意输入-Seeking an equation using the Newton iterative method can be any input at the root, the coefficient equation of one point
rms
- Root mean Square module, can be synthesized to gates, 300 MHZ operating frequency. Test bench included
First-root-traversal-non-recursive
- 二叉树的非递归先根遍历遍历 二叉树的非递归先根遍历 -Two fork tree of non recursive traversal traversal Two fork tree of non recursive traversal traversal
c29
- VC++编写的又一个小型数学计算器，能进行基本的加减乘除运算，除此之外，还可以进行平方根运算，还具备清屏功能。-Written in C++ and a small mathematical calculator can perform basic arithmetic operations, in addition, it can also be a square root operation, but also have clear screen function.
Experiement1
- C#写的两个简单的计算方法的小程序，分别用二分法和牛顿迭代法求根.-A simple program uses C# language to get the root of a equation using method of bisection and Newton s method
acbrt.c
- Fast approximate cube root of a float.
asqrt.c
- Fast approximate square root of a float.
rcosine
- 简单介绍根升余弦滤波器的概念和设计，附有毕业设计。还有一些代码。-Brief root raised cosine filter concept and design, with graduation. There are some code.
BinarySearchHeapConstruction
- Binary Search Heap Construction-Read the statement of problem G for the definitions concerning trees. In the following we define the basic terminology of heaps. A heap is a tree whose internal nodes have each assigned a priority (a number) such that
Two-body-problem
- 二体问题的求解，以读文件的形式输入，解算结果为6个开普勒轨道根数-Two body problem solving, in order to read documents in the form of the input, the calculating results for root number six Kepler orbit
test01
- 1.将产生未综合系统的根轨迹图以及0.707阻尼比例，你可以交互的选择交点运行点，界面能显示运行点的坐标，增益值，以及近似为二阶系统估算的超调量，调整时间，峰值时间，阻尼比，无阻尼自然震荡频率以及稳态误差。 2.显示未综合系统的阶跃响应。 3.输入控制器的参数，绘制综合后系统的根轨迹图以及显示综合的设计点（主导极点），允许不断改变控制器参数，直到所绘制的根轨迹通过设计点。 4.对于综合后的系统，显示运行点的坐标，增益，近似为二阶系统估算的超调量，调整时间，峰值时间，阻尼比，无阻尼自然
socket
- 一个简单的socket发送文件夹程序。服务器端选择文件保存位置，并开启监听。客户端选择要发送的文件夹，并输入服务器IP，即可发送。主要用于初学者利用socket发送文件夹时，如何通过遍历文件名去发送文件夹。缺点是不能发送含有与根文件夹相同名字的子文件-a simple socket program for transmitting folder.The server choose the place where to save the folder and start listening.The
IMM-SRCKF
- 载机跟踪高速高机动目标时，使用交互式多模型算法，该算法中又用平方根容积卡尔曼滤波器进行滤波。-When the carrier aircraft tracking high-speed maneuvering targets, using interactive multiple model algorithm in the Kalman filter is also used to filter the square root of the volume.
erchashu
- 设二叉树结点值为大写字母，输入二叉树的前序遍历和中序遍历序列，生成此二叉树，输出该二叉树的后序遍历和按层次遍历序列。输入某结点值，在二叉树中查找该结点，若该结点存在，则输出从根到该结点的路径，否则给出不存在信息。 -Binary tree node is set in capital letters, enter the pre-order traversal of a binary tree traversal sequence and generates this binary tree
ha-fu-man-shu
- 给定n个权值作为n的叶子结点，构造一棵二叉树，若带权路径长度达到最小，称这样的二叉树为最优二叉树，也称为哈夫曼树(Huffman Tree)。哈夫曼树是带权路径长度最短的树，权值较大的结点离根较近。-Given n weights as leaf nodes n, constructing a binary tree. If the right path length to a minimum, said such a binary tree for the optimal binary tre
ADB_ScreenCap
- 安卓screencap截屏软件源码。调用screencap 命令截图彼岸保存到sdcard 需要root权限- Andrews screencap screenshots software source code
Tboard-mount-NFS-file-system
- 目标板挂载NFS根文件系统，详细讲解了通过NFS进行网络启动的整个过程。-Target board mount NFS root file system, explained in detail through the NFS network to start the entire process.
1176
- 解方程a*x*x+b*x+c=0,输入a，b，c解出方程的根-Solution of equations a* x* x+ b* x+ c = 0, input a, b, c solved the root of equation