dcmot0

The function calculates the mean curvature of the input structured matrix data.

This is a small program to create indexs for two binary trees and combine them to a new 003 * index tree and output the new tree,the second tree only has the left child tree then 004 * if the first tree has no left child tree,insert the second tree into the first tree as 005 * its left child and if the first tree has the left child tree,then insert the first tree 006 * into the second tree as its left child. (This is a small program to create indexs for two binary trees and combine them to a new 003* index tree and output the new tree, the second tree only has the left child tree then 004* if the first tree has no left child tree, insert the second tree into the first tree as 005* its left child and if the first tree has the left child tree, then insert the first tree 006* into the second tree as its left child.)

非线性薛定谔方程求解光传输过程matlab(Isotropic_Fiber_Simulations.zip)

计算天线阵列远场方向图，支持各种幅度加权，相位加权，可自行指定阵元方向图(calculate the farfield of an antenna array with various degrees of freedom)

说明：  MATLAB仿真ofdm的经典例子，上边的注解很详细(the example of ofdm)

说明：  swarm模型代码--3D 用matla开发，模拟集群功能(swarm model code- 3D with matla development, simulation cluster function)

it is a pll (phase locked loop simulation)

Gabor atoms generation

matlab的详细解述，对于学习有很大的帮助，有助于进一步做好程序(It can help you )

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