新版完整Visio图库

压缩包里面包括AD7616(datasheet,sch,pcb,project.)整套demo资料，可以自己制作demo测试

android蓝牙接收单片机数据并绘制波形

很不错能准确的计算出基波和各次谐波的有效值和相位。很不错的谐波分析程序

【实例简介】基于DSP的svpwm算法编程，C语言程序模块化

低温等离子体放电模拟软件VORPAL，低温等离子体放电模拟软件VORPAL

【实例简介】本程序是基于MATLAB编程的卫星轨道动态仿真 利用M文件进行编程实现了 三维立体动画的卫星动态显示

EtherNet/IP(ethernet/Industrial Protocol)是由洛克威尔自动化公司开发的工业以太网通讯协定，由开放DeviceNet厂商协会（ODVA）管理，可应用在程序控制及其他自动化的应用中，是通用工业协定（CIP）中的一部分.Ethernet/IP允许工业设备实时的交换应用信息. 采用生产者/消费者模型实时交换控制数据。Ethernet/IP使用标准的IEEE802.3技术.采用TCP/IP技术传输CIP报文

基于MFC机器视觉OpenCV条码识别系统，采用Zbar开源条码识别库实现条码识别。

此资源实现安卓APP注册登录功能，通过Android Studio编写界面和相应功能，用Eclipse开启web服务器进行客户端与服务端之间的通信，并且将用户的账户密码经过MD5的加密后存入Mysql数据库中。

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