OpenCV单目视觉定位（测量）C++代码

压缩包里有扰动干扰法，电导增量法，变步长扰动法等八个.m文件

simulink 永磁同步电机双闭环仿真实例，共包含四个仿真实例，均可以运行通过，还包含部分仿真资料，可供需要进行永磁同步电机仿真的工程师参考

ArcGis把jpg、png格式地图图片转换为tif格式

有代码 原理图 和说明。本设计描述了一款嵌入式数字示波器，在硬件上采用了32位微处理器STM32和高速A/D转换器ADS830等器件，软件上搭载上µC/OS-II实时操作系统，简化编程，提高系统的效率和稳定性。输入信号从系统的无源探头接入，先经过的是AC/DC耦合电路，然后经过信号调理电路，被调理后的信号接着由A/D转换器转变成数字信号，再经过高速缓存器FIFO，信号数据即被传送到微处理器STM32中，由微处理器STM32完成对信号数据的处理，最后把波形还原到液晶上，并显示该信号的频率、电压等技术指标，以供用户参考。

单片机是STM32F103ZET6，结合HX711读取压力传感器传输进来的压力值，利用串口送到PC显示

关于无线传感网络TDOA定位算法的一种。。。我的算法是基于三维定位的。。目前大都基于二维定位

从PID技术到_自抗扰控制_技术_韩京清.pdf

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

matlabb编写的现代控制系统程序，可为学习现代控制理论的学生参考，加深对理论的理解

里面包括SP,OMP,IHT,CoSaMP,GBP,IRLS等算法源程序，还有几个文档，pdf,是对几种算法的解释。