matlab

mathematic全美经典教程，中文版本，非常实用。(mathematic language tutorials, Chinese)

平面波展开法计算二维能带结构，教FDTD快，资源占用少(Two-dimensional plane wave expansion method to calculate the energy band structures, the FDTD fast, low resource consumption)

均匀线阵列数字波束形成matlaab程序，与大家一起分享 (Uniform linear array digital beamforming matlaab procedures, and shared with)

基于RSSI室内定位算法仿真，运用MATLAB平台实现定位算法(Simulation of indoor location algorithm based on RSSI)

采用3D Bresenham算法在两点间划一直线 ％ This program is ported to MATLAB from: ％ B.Pendleton. line3d - 3D Bresenham s (a 3D line drawing algorithm) ％ ftp://ftp.isc.org/pub/usenet/comp.sources.unix/volume26/line3d, 1992 ％ ％ Which is referenced by: ％ Fischer, J., A. del Rio (2004). A Fast Method for Applying Rigid ％ Transformations to Volume Data, WSCG2004 Conference. ％ http://wscg.zcu.cz/wscg2004/Papers_2004_Short/M19.pdf (3D Bresenham algorithm used in a straight line between two points This program is ported to MATLAB from: B. Pendleton. Line3d- 3D Bresenham s (a 3D line drawing algorithm) ftp://ftp.isc.org/pub/usenet/comp.sources.unix/volume26/line3d, 1992 Which is referenced by: Fischer, J., A. del Rio (2004). A Fast Method for Applying Rigid Transformations to Volume Data, WSCG2004 Conference. http :// wscg.zcu.cz/wscg2004/Papers_2004_Short/M19.pdf)

Project about a solar robot, simple and fun.

最小费用最大流问题是经济学和管理学中的一类典型问题。在一个网络中每段路径都有“容量”和“费用”两个限制的条件下，此类问题的研究试图寻找出：流量从A到B，如何选择路径、分配经过路径的流量，可以达到所用的费用最小的要求。(Minimum cost maximum flow problem is economics and management in a class of typical problems. Each path in a network has the " capacity" and " costs" two limiting conditions, such problems of trying to find out: Flow from A to B, how to choose the path, the path of the flow through the distribution can be achieved The use of the minimum cost requirements.)

unit commitment problem

this code calculate the euclidian distance. h = waitbar(0, Distance Computation ) switch nargin case 1

用于对基于空间点的三维重建,非常好用,请多多指教,QQ:526289(for space-based point of the three-dimensional reconstruction, very handy, exhibitions, QQ : 526289)