stm32 在RAM中调试，已测试通过

热血江湖V2.0GS程序源代码可运行 并且完全大部分汉化的代码

个人博客 html 模板个人博客 html 模板个人博客 html 模板

总共有9个光学实验用Matlab进行仿真，如有雷同，纯属巧合。希望大家喜欢Matlab或者光学的，可以好好看看这个资源。实验的题目分别为：单缝衍射，光栅衍射，矩孔衍射，朗伯余弦体，迈克尔逊干涉，牛顿环，杨氏双缝干涉，圆孔衍射，正选光栅。

Opus音频测试http://blog.csdn.net/bedpotato/article/details/20144171

sba一个通用的稀疏光束法平差的软件包，可以用于摄影测量软件开发

进一步了解java开发的相关知识，掌握java开发的基本技术，丰富java开发的实战经验。学习SQL的基础知识及正确的运用方法，和有用的相关技术，提高自己的工作效率。通过实习，巩固大学所学专业的基本知识，提高分析、判断和处理实际问题的能力，锻炼自己的实际动手能力，增强自己的团队协作意识，了解软件开发的思考角度和主要流程。为毕业之后能够更快地进入工作状态并且能够更好的工作，打好一定的基础。

PHP仓库管理系统，测试环境：win7，wamp3.0.0（需要打开短标签）。apach2.4.7, php5.6.15, mysql5.7.9.

基于MATLAB的数字图像拼接，可以将两幅或多幅图像进行拼接

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实现的空域LSB算法，可输入密钥加密文本信息，有较好的交互界面