《Hadoop大数据技术》课程设计报告.docx

基于Tensorflow用CNN（卷积神经网络）处理kdd99数据集，代码包括预处理代码和分类代码，准确率99.6%以上，并且快速收敛至最优值。 (Based on Tensorflow (convolutional neural network) processing KDD99 data set based on CNN, the code includes preprocessing code and classification code, the accuracy rate is more than 99.6%, and quickly converge to the optimal

为了提高企业信息化水平，促进企业管理的规范化、制度化、流程化，XX单位决定实施人力资源管理系统。希望通过这个系统的实施规范人事档案的管理，规范薪酬体系和薪酬发放的管理，规范人事的调动管理、培训管理和激励管理。并对招聘工作的职位发布、简历、面试、招聘题库、招聘考试、录用等环节加以规范。系统还需提供人事档案的导出和报表功能

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

波速方向图，阵列数为10 在u空间和theta空间作出相应的波束方向图，图像效果良好。

文章同步：http://blog.csdn.net/wgyscsf/article/details/51338099

模糊控制中有关倒立摆的实验，附带源程序和讲解的ppt

关于信息融合的一本好书，应用于诸多方面。

已知圆弧半径r，起点座标P1、起点切线方向角alpha1，终点切线方向角alpha2，画圆弧程序

C#开发的大学生就业咨询系统，供有需求的朋友下载。很好的代码，所以分值有点高。

整理的Echarts省市县地图js文件和json，省市很全，不骗人，可以放心使用。希望对你们有帮助