基于中颖sh79f166A demo 上手代码

里边涉及到了按键，按下不同的键可以发出不同编码的信号。用到的载波是用单片机产生的38k的方波。

关于粗糙集和邻域粗糙集的基本理论和程序算例包含邻域粗糙集计算的matlab算例，说明文档（个人编写的）说明文档包括了粗糙集和邻域粗糙集的基础知识讲解，实际算例，程序的应用介绍，程序使用算例。如果你没有积分下载，可以加我qq379786867，我发给你。这里设置了积分下载主要是为了我能赚取一些积分下载其他资源，谅解！压缩文件中包括三个m文件，一个mat文件，一个pdf文档。

基于FPGA使用verilog语言开发的音乐播放器

matlab GUI串口调试助手，利用GUIDE 编写界面进行串口调试，附带有调试界面的源代码

LFMCW雷达发射接收信号及测距matlab仿真

【实例简介】freeModbus移植在2812上，已调试通过,可以直接在2812DSP中使用

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

使用混沌序列图像加密技术对图像进行处理，实现信息加密，主要运用异或运算将数据进行隐藏。

svm多分类代码，包括一对多和一对一两种多分类策略，内含数据集，代码可以直接运行，对了解多分类绝对大有帮助。

武汉大学遥感信息工程学院数字图像处理实习资料，值得下载