md_sp_code_archive

L为正六边形边长，默认10 H为1*2的向量，H(1)和H(2)分别代表待填充矩形的x和y方向的边长,默认[100 100] 若H输入为1*1尺寸，则默认为边长为H的正方形 返回值为所有六边形的顶点横纵坐标 调用举例： HoneycombPattern_new HoneycombPattern_new(5) HoneycombPattern_new(1,[50 40]) 作者：Neptune_zx(@MATLAB Forum) Time：2010/11/06">

matlab to show stock situation

采用集中质量法求解水平成层场地的地震响应，其中包含newmark求解动力方程(Quality level of a centralized method for solving the seismic response of layered space, solving the dynamic equation which contains newmark)

说明：  This guide explain s function for matlab simulink

说明：  高压缩比信号的重构问题，压缩感知理论相关(Reordering for Better Compressibility Efficient)

是关于空时编码的nrs ，给出了Matlab程序实现，希望有借鉴意义。 (on space-time coding nrs given Matlab program, with the hope of reference.)

用matlab进行的有关无线传感器网络定位的研究(Carried out using matlab on the positioning of wireless sensor network research)

Matlab Spline 工具箱，能够创建各种样条函数(Matlab Spline toolbox)

lab experiments of wireless communication laboratory

  最小费用最大流算法通用Matlab函数 基于Floyd最短路算法的Ford和Fulkerson迭加算法   基本思路：把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条   自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流   量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新   确定,如此多次迭代,最终得到最小费用最大流.( Minimum cost maximum flow algorithm for general Matlab functions based on the Floyd shortest path algorithm of Ford and Fulkerson superposition algorithm of the basic ideas: the cost of unit flow on the arc as a certain length of Floyd for the most short-circuit method to determine the one percent V1 through Vn are the most short-circuit then this short circuit as a scalable road, a method for solving the maximum flow problem on flow increased to the maximum possible value that the shortest way increased traffic, the cost of unit flow on each arc sure, so many iterations, the final minimum cost maximum flow.)