单片机Max485协议转TTL协议

包含多种算法的微分方程求解程序 如Adams，龙格贝塔等方法-Contains a variety of algorithms for solving differential equations of programs such as Adams, Long Ge Beita and other methods

十进制、八进制、二进制、十六进制的相互转换-Decimal, octal, binary, hexadecimal conversion

AR 模型拟合，解决多变量自回归 (AR) 模型的参数估计问题-AR model fitting, since the settlement multivariable regression (AR) model parameter estimation problems

MEPG4协议编解码算法和源代码、DEMO等

这是我用Des-encrypt来加密和反加密文本文件的例子，这是一个简单的示例代码，对所有聊天程序都非常重要

void CRandDlg::OnOK()  { // TODO: Add extra validation here int a[7]; int b=0; srand((unsigned)time( NULL ));  for (int i=0;i

Will perform 3D Gaussian quadrature over a user-defined volume. The volume is defined by the user with function definitions entered in the appropriate spaces provided on the GUI. The user can change the number of Gauss points to use. Function inputs need not accept vector args. -Will perform 3D Gaussian quadrature over a user-defined volume. The volume is defined by the user with function definitions entered in the appropriate spaces provided on the GUI. The user can change the number of Gauss points to use.Function inputs need not accept vector args.

//=== === === === === === ===== //函数说明 //函数名称：Correlation //函数功能：计算最小二乘法拟合的多项式的相关系数 //使用方法：int M------拟合多项式的项数（已知条件） // double *b---拟合曲线的系数,按升次排列（已知条件） // double *x---结点x轴数据（已知条件） // double *y---结点y轴数据（已知条件） // double *Yg--结点估计值，与*y相对应，个数为m（过程变量） // int m------结点个数（已知条件） //注意事项：多项式阶数最高为10,多项式的形式为 y = b0 + b1*(x-Xavr)... -//=== === === === === === === === === === === =====// Function that// function name: Correlation// Function: Calculation of the polynomial least squares fitting correlation coefficient// Usage: int M------ polynomial fitting the number of (known conditions)// double* b-- Fitting curve coefficient, or times by arrangement (known conditions)// double* x--- node x-axis data (known conditions)// double* y--- node y-axis data (already known conditions)// double* Yg- the estimated value of node, and* y correspond to the number for m (process variables)// int m------ node number (known conditions)// Note: polynomial order up to 10, the polynomial

哈夫曼树又称最优二叉树，是一种带权路径长度最短的二叉树。所谓树的带权路径长度，就是树中所有的叶结点的权值乘上其到根结点的路径长度（若根结点为0层，叶结点到根结点的路径长度为叶结点的层数）。树的带权路径长度记为WPL=(W1*L1+W2*L2+W3*L3+...+Wn*Ln)，N个权值Wi(i=1,2,...n)构成一棵有N个叶结点的二叉树，相应的叶结点的路径长度为Li(i=1,2,...n)。可以证明哈夫曼树的WPL是最小的。

单纯形法解决线性规划问题!!! 有过程！-Simplex method to solve linear programming problems!!! A process!