DG method for transport equations

应用背景基于野火K60的直立的程序，拿来就可以用。改改参数，就可以直立了。建议学习这个程序之前看看清华的直立方案的视频。对理解程序有很大帮助，用的是融合滤波。配合虚拟示波器看融合后的波形是否跟踪的很好。关键技术野火，K60,清华直立方案，融合滤波，虚拟示波器，

id3算法实现决策树的matlab源码。可运行，附测试集，代码思路清晰，注释丰富，易懂。

Industrial Mathematics

Prediciendo resultdos de partidos de 足球德尔世界巴西 2014年，con redes y bayesinas 大数据

资源描述 全部作业，01-10 Zhou Xiaofang Perl 作业全部内容，每节的作业都有，有需要的同学或者朋友欢迎下载 全部代码亲测可用 本人是初学者，也欢迎大牛指教

"CRC算法函数 Public Function CRC(STR1 As String) As String Dim CRCREG As Long Dim MVAL As Long Dim R As Integer Dim T As Integer CRCREG = 65535 For R = 1 To Len(STR1) Step 2 MVAL = Val("&H" + Mid(STR1, R, 2)) CRCREG = CRCREG Xor MVAL CRCREG = C

数值分析中最常用的14个程序： 01_N皇后问题 01_循环赛程表 02_分段线性插值 02_牛顿插值法 03_构造正交多项式 03_最佳一致逼近多项式 04_简单迭代法求方程根[1+1；x] 04_简单迭代法求方程根[sqrt(x+1)] 05_复化梯形公式求积 06_尤拉公式解初值问题 08_高斯消去法解方程组 09_连分式法求积 10_迭代法解线性方程组 10_雅可比方法-Numerical analysis of the 14 most commonly used procedures: 01_N Queen s problem 01_ cycle calendar 02_ piecewise linear interpolation 02_ Newton interpolation 03_ structure orthogonal polynomials 03_ best uniform approximation polynomial 04 _ a simple iterative method for root equation [1+ 1 x] 04_ simple iteration equation for the root [sqrt (x+ 1)] 05_ complex formula of trapezoid quadrature formula 06_ yula 08 initial value problem solutions _ Gaussian elimination solution equations 09_ continued fractions method 10_ quadrature iteration solution of linear equations Jacobian 10_ Ways

这个程序是一个Win32程序，计算Fibonacci斐波纳契数列(一种整数数列, 其中每数等于前面两数之和)。其定义是f(1) = 1，f(2) = 2，并且当n>2时， f(n) = f(n-1) + f(n-2)。源代码种给出了三种计算方法。第一种方法用递归，第二种方法用大数组，第三种方法用小数组。此外，这个程序还具备多线程特性，所以在运算时可以做其它操作。代码用到了以前创建的Win32类。测试为发现bug和内存溢出。--Calculate Fibonacci value.

FFT和FIR 快速傅里叶变换和FIR滤波器实验程序-Fast Fourier Transform FFT and FIR and FIR filter experimental procedure

应用背景In generated networks, selecting one node as source and some nodes as receivers in random (single source multicast network), we make performance test for network coding based multicast route algorithm (we put forward it ourselves, corresponding to high multicast rate and low multicast rate), shortest path distribution tree route algorithm (DIJKSTRA algorithm) and Maximum-rate distribution tree route algorithm (PRIM algorithm), respectively. 关键技术 In this program, two things have been done: (1) generate random topologies (2)performance test。   network coding cap:     5.0000  dijk cap:     5.0000  prim cap:     5.0000  network coding res1:     0.0000--res2:    12.0000  dijk res:    14.0000  prim res:    14.0000  average degree:     2.