VB.NET源代码实例集.

ACCESS版教学管理系统教学管理系统 ACCESS

Workbench3.0&Vxworks6;.6集成环境使用指导 第一部分 VxWorks/worksbench3.0简介第二部分 worksbench3.0/Tornado2.2比较第三部分 worksbench3.0的工程视图第四部分 建立一个例子工程第五部分 建立交叉开发环境

【实例简介】基于PCA的人脸识别matlab程序，内有ORL人脸库，这是改进版，算法效率有提高。

IMU惯性导航姿态算法 全英文的方向滤波

SIFTPCA-SIFTSURF论文文章和对应的源代码

jfeechart 开发文档 完整的代码 拷贝就能使用非常详细

支持向量机进行分类 你值得拥有，一定完美运行。有问题 一起讨论 下载 可以的话 请好评。

银灿IS917U盘PCB电路（原理图+PCB图）！

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

在线音乐网站源代码，无BIN文件，代码完整，使用SQL 2000数据库，内附完整安装使用说明。