forthcharpter

matlab的一本很好的资料，含有大量实例，及程序源码(matlab a good information, contains a lot of examples, and program source code)

Book on MatLab Partial Dierential Equations in MATLAB 7.0

cx_3 lpp source code with many examples

实战matlab 并行程序设计 适合入门并行(Actual matlab parallel programming, suitable for entry parallel)

methods of Direction of arrival estimation. (DOA) such as MUSIC, MVDR, Min-Norm and Classical Beamforme.

Solving Index-1 DAEs in MATLAB and Simulink

a part of som for clustering muti dimensional data or big data.

it s a sample for initiaiton to matlab

说明：  它主要研究的是多因变量对多自变量的回归建模，特别当各变量内部高度线性相关时，用偏最小二乘回归法更有效。另外，偏最小二乘回归较好地解决了样本个数少于变量个数等问题。 偏最小二乘法是集主成分分析、典型相关分析和多元线性回归分析3种分析方法的优点于一身。它与主成分分析法都试图提取出反映数据变异的最大信息，但主成分分析法只考虑一个自变量矩阵，而偏最小二乘法还有一个“响应”矩阵，因此具有预测功能。(It is mainly a result of the study is a multi-variable regression modeling and more independent variables, especially when the internal height of each variable linear correlation, partial least squares regression method is more effective. In addition, partial least squares regression solves the number of samples is less than the number of variables and other issues. Partial least squares method is a set of principal component analysis, canonical correlation analysis and multiple linear regression analysis of the advantages of the three methods in one. It is the principal component analysis are trying to extract the maximum information reflects data variability, but the principal component analysis considers only one independent variable matrix, and partial least squares and a &quot response&quot matrix, predictive capabilities.)

说明：  用栅格模型表示工作环境,确定机器人运动起始结点和目标结点后,对工作环境进行分析,选取起始点与目标点之间连线附近的若干栅格,以被选取栅格为关键点,采用蚁群算法分别计算关键点与起始点和目标节点之间的最短路径,求取全局最短路径(With grid model to represent the working environment, robot motion after initial nodes and target, analysis of working conditions, selecting starting point and the target point near the connection between a number of grid, grid for the key points to be selected, key point and the starting point is obtained by using the ant colony algorithm respectively and the shortest path between the target node, calculate the global shortest path)