python游戏编程入门源代码

dct图像压缩的matlab实现 dct变换是图像压缩的重要方法

【实例简介】可以运行的3相全控桥PWM波形产生电路matlab仿真建模

蓝桥杯VIP题目与全套测试数据

fluent 命令文档，比较有用　

ISP下载器的驱动，测试AT89S52可用，有需要的可以下载

本科毕业设计，基于模式识别的人脸识别系统 。。文件包含毕设过程中的所有文档——开题报告，中期报告，毕设论文，程序，答辩ppt等

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

精心收集的遗传算法相关资料，包括遗传算法示例代码和matlab实现

运用贪心策略解决0 1背包问题void beibao(int *w,int *v,int *x,int n,int *C){ int i,j,temp; for(i=0;i

SLIC： simple linear iterative clustering的简称，即简单的线性迭代聚类。 这是一个基于聚类算法的超像素分割，由LAB空间以及x、y像素坐标共5维空间来计算。不仅可以分割彩色图，也可以兼容分割灰度图，它还有一个优点就是可以人为的设置需要分割的超像素的数量。