AD9833驱动程序

1.下载zip文件后解压，保证解压后的jar和txt文件（用来保存最高分）在同一文件夹下。2.取自官方2048的创意，用Java实现，只要电脑装有JDK就能玩！（当然得用Java编译器而不是解压软件运行jar文件）从而打破用电脑玩2048只能装安卓模拟器或玩网页版的局限。2.没有动画效果，以后有时间再补上。4.随机出现2和4的比例大致为9:1，试试你能玩2048吗？最高能挑战多少分？5.若体验过程中出现bug或你有更好的建议，欢迎和我联系，我会继续改进，谢谢！

LabVIEW读取Excel文件中的值，简单清楚

【实例简介】

计算机视觉摄像机定标，点的投影和三维重建，能够完成投影矩阵、内外方位元素计算，具体使用说明在资源内部

自己编的，用最简单的SELECT模型和多线程技术实现的，还有许多不足之处，但是能实现基本的私聊，群聊，服务器广播功能，我会在以后加以改进。

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

非常漂亮的javaSwing界面源代码 CS架构

该demo基于vs平台实现ICP的用发，实现点云配准，代码能够直接使用

三角质心算法：用于三点定位计算坐标，已测试相对三角算法来说提高了精准对，可以增加锚节点数量，分别代入算法，获得多组坐标，再平均计算，则可进一步提高精确度。程序已经应用现有项目，无bug

OFDM信号功率谱密度的仿真代码，里面包括OFDM系统的频谱仿真和功率谱密度仿真