MFC编写的心电采集程序

关于多载波通信的最完整最详细的介绍，包括OFDM，FBMC，GFDM等的原理等

用过ENVI的人们应该比较熟悉IDL，表里收集了一些常用的IDL函数

自己写的一个labvIEW 数据采集与保存的源程序，可以作为参考

【实例简介】bp神经网络 simulink 计算机控制与仿真 预测 matlab bp

历年计算机二级MS_Office真题及答案

alternating direction method of multipliers优化算法讲解OutlineDual decompositionMethod of multipliersAlternating direction method of multipliersCommon patternsExamplConsensus and exchangeConclusionsDual decompositionDual problemp convex equality constrained optimization problemminimizesubject to Ax= 6e Lagrangian: L(a, g)=f(a)+y(Ac-bdual function: g(y)=infx L(, g)e dual problem: maximize g(g)recover x*=argminL(, y*)Dual decompositionDual ascentgradient method for dual problem: y+l=yk +aVg(yky ")=A c-b, where a= argmin L(a, y")b dual ascent method isk+1gminz L(a, yk/-minimization(Axk+I-b)// dual updateworks, with lots of strong assumptionsDual decompositionDual decompositione suppose f is separablef(x)=f1(x1)+…+fN(xN),x=(x1Nthen L is separable in x: L(a, y)=L1(a1, 3)+...+Ln(N, 3)-y bLi(ai, y)=fi(ai)+y Aiaie -minimization in dual ascent splits into N separate minimizationsk+1argmin Li(li, y)Which can be carried out in parallelDual decompositionDual decompositiondual decomposition(Everett, Dantzig, Wolfe, Benders 1960-65k+1argLi(ei, y)N A: k+scatterupdate i in parallel, gather Ai k+solve a large problemby iteratively solving subproblems(in parallel)dual variable update provides coordinationworks, with lots of assumptions; often slowDual decompositionOutlineDual decompositionMethod of multipliersAlternating direction method of multipliersCommon patternsExamplConsensus and exchangeConclusionsMethod of multipliersMethod of multipliersa method to robustify dual ascentb use augmented Lagrangian(Hestenes, Powell 1969),p>0(, y)=f(c)+y(Ax-b)+(p/2)Acmethod of multipliers( Hestenes, Powell; analysis in Bertsekas 1982)k+1argmin Lp(a, yD(A.(note specific dual update step length pMethod of multipliersMethod of multipliers dual update stepoptimality conditions( for differentiableAcx-b=0, Vf(a*)+A(primal and dual feasibility)Since ah+1minimizes Lp(a, y)k+1 kf(x4+1)+A7(y+p(AVxf(at)+adual update yti=y+p(k+1k+1dual feasibleprimal feasibility achieved in limit: A k+I-b>0Method of multipliers

xgboost训练数据，Mushroom Classification。Mushroom Classification--xgboost训练数据

实现Logistic Regression的开源代码，LBFGS应该是目前普遍被采用的一种方法，代码简洁，注释详细，不得不拥有！

自己编写的matlab归一化处理程序。网上有很多相关程序，但是要么非常复杂，要么就是功能不符合自己的要求，所以就自己编写了一个。资源是matlab的.m文件，可以实现对多维数组的每一列进行单独的归一化处理，归一化的结果就是每一列的数据均落在了0—1之间。网上有的程序是对整体进行归一化处理，那样还是避免不了大数吞小数的现象，所以必须进行单独列的归一化处理。程序其实很简单，供大家参考学习使用。

人大金仓数据库SQL手册：详细讲解SQL语法