一本关于FDTD算法的书。 介绍了FDTD基本理论和一些实际的应用...

工程常用数值算法＿C语言-works numerical algorithm commonly used language _C

资源描述四旋翼无人飞行器的PID算法程序，飞控板电路以及部分详细说明，别的不多说，自己看吧。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。

用c++编的N个实例子， 有参考价值-With c++ Allocation of N examples son, a reference value

资源描述Write a program to find the weighted shortest distances from any vertex to a given source vertex in a digraph. If there is more than one minimum path from v to w, a path with the fewest number of edges is chosen. It is guaranteed that all the weights are positive and such a path is unique for any vertex.

流形学习，一种数值变换的前沿技术，广泛用于数据压缩，降维等-Manifold learning, a numerical transform the forefront of technology, widely used in data compression, dimensionality reduction, etc.

数字带通滤波器的设计过程。共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.

在一个圆形操场的四周摆放着n堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的2堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的得分。试设计一个算法，计算出将n堆石子合并成一堆的最小得分和最大得分。 编程任务：对于给定n堆石子,编程计算合并成一堆的最小得分和最大得分。-Playground in a circle around the stones are placed n heap. Stone is to have the order to merge into a pile. Provisions can only choose 2 adjacent stones piled into a heap of new and new pile of stones a few in mind for its combined score. Try to design an algorithm to calculate the n heap into a pile of stones the minimum scores and maximum scores. Programming tasks: for a given n stack stone, into a pile of programming the calculation of the minimum scores and maximum scores.

应用背景主要是对手写字体进行识别，首先训练手写字体库，可在官网下载手写字体库。对样本库中的样本进行训练，进而识别多种手写字体，主要针对0--9这10个数字，可以准确进行识别。关键技术主要采用C和OPENCV混合编程，提取样本HOG特征，运用SVM分类器对样本进行分类识别。获得训练分类器后，可以自己手写一个0--9中的任意字体，放入分类器中进行识别。

这是简单的网络模拟的 MST 分区算法和直径分区算法。你几乎可以生成随机节点并创建虚拟链接路径。查找边缘节点，断开连接的节点。最短路径。和节点分区。等，还可以看到在图形视图中的所有过程。使用鼠标可以拖动和放置任何节点。

非线性方程求解例子--Examples of Non Linear equation`s solution