ISD1760语音模块，含原理图和PCB，板子已使用过，100%没问题

利用PSO训练BP神经网络的MATLAB源码,加入数据即可运行。

超低接收电流芯片SX1212官方驱动程序及说明文档

【实例简介】在win7下采用vs2015编程的modbus上位机程序,c++程序，下载后可直接运行，对使用libmodbus入门有很大帮助，在此基础上可参考libmodbus例程及其它资料实现modbus tcp编程。含libmodbus的使用方法、虚拟串口工具及一本modbus入门书籍。

SPH算法是LS-DYNA的无网格方法，其主要用于模拟爆炸，冲击断裂等物理过程，具有很高的精度和好的适用性

资源是基于Stm32F407的代码，可以在正点原子探索者上面非常好的运行，代码的作用是轮询扫描共计24路的ADC接口并且将 得到的ADC的值保存在数组中，最终通过屏幕的方式显示出来（使用开发板的时候很多IO被内置上下拉，这不是程序错了，是实际的硬件连接导致的，在实际使用中这个是不需要担心）

各种c语言处理图像的代码，中值滤波、直方图处理、旋转平移等等

十万词汇英汉词典词库JSON格式,用心整理的一个词库，用JSON格式存储，直接可供JAVASCRIPT编程使用，适合制作在线或离线词典，或者背单词应用，注意只包含简要释义，不包含音标注音，更加精简节省存储空间。

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仿真

人工神经网络原理及仿真实例书及+matlab源代码