关于复数计算的简单程序

生成条形码的DLL文件及其使用例子- Production bar code DLL document and its use example

各种内部排序算法的集合，很经典的代码。-internal algorithm assembly, classic code.

数值分析里面解方程的一种方法 叫什么忘记了 几年前写的东西 站长补充下嘛-Numerical Analysis Solution of equation inside What a way to have forgotten to write something a few years ago under the head to add them

FAST角点检测算子的C语言实现，作者原作-FAST corner detection in C

采用NLJ随机搜索的方法辨识一个以状态方法表示的非线性系统。选其初值 a1(0) =50 , a2(0) =100 , a3(0) =100 , a4(0) =50 , a5(0) =10 , 选范围为 r(1)(i)=0.5 a(0)(i) , 取数据长度 L ＝40, t =0.005 , 性能指标 J＝ 。迭代计算结果得 a 的估计值 1=17.6043243, 1=17.5977, 2=72.9573, 3=51.3014, 4=22.9889, 5=5.99965, J = 0.000000916 。-Using NLJ random search method to identify a method that the state of the nonlinear system. Election of its initial value a1 (0) = 50, a2 (0) = 100, a3 (0) = 100, a4 (0) = 50, a5 (0) = 10, choose the range of r (1) (i) = 0.5 a (0) (i), check data length L = 40, t = 0.005, performance index J =. Iterative calculation results have a estimated value of 1 = 17.6043243, 1 = 17.5977, 2 = 72.9573, 3 = 51.3014, 4 = 22.9889, 5 = 5.99965, J = 0.000000916.

算法，图论，dfs，新人，算法，图论，dfs，新人算法，图论，dfs，新人算法，图论，dfs，新人算法，图论，dfs，新人算法，图论，dfs，新人算法，图论，dfs，新人算法，图论，dfs，新人算法，图论，dfs，新人算法，图论，dfs，新人算法，图论，dfs，新人

Bellman Ford algorithm for finding the shortest path between nodes is an algorithm used.  primarily in the gray box identifies nodes are between our EDGE. Then we set the starting node (for one example)  resulting path will be drawn on lef

本代码实现了两种变化检测方法。输入是无符号的差分图像 （例如两个视频帧或一个帧减去估计的背景），这是阈值以生产更改映射。

模拟正态分布现象的Java小程序-simulated normal phenomenon of Java programs

快速傅立叶算法，按时间和按频率抽取的基2算法-Fast Fourier algorithm, time and frequency taken by the base 2 Algorithm