erereeeeeeeee

聚束SAR系统开发的模拟和重建代码。在不同频域下的变化。(Develop a simulation and reconstruction code for the spotlight SAR system.)

fuzzy_cluster模糊聚类分析，本函数使用的是直接聚类法，直接输出聚类信息，无返回值 输入参数data是需要分类的数据，将会对data的列分类，请输入数据前把需要分类的向量按列保存到矩阵data 输入参数numda是分类的分类点，如果不知道可以先省略，系统默认1-0依次减小用以方便判断分割点，然后用户再细分( Fuzzy_cluster fuzzy clustering analysis, the function uses the clustering method is direct, direct output clustering information, no return value input parameter data is needed to classify data, classification of data will be listed, enter the data before the need saved by the column vector classification matrix data to the input parameters numda profile classification point is, if you do not know can be omitted, in order to reduce the system default 1-0 split point for easy judgment, then the user is subdivided)

说明：  这是一个创建BP神经网络的matlab源代码，包括BP神经网络的创建、曲线拟合等内容。对初学者很有帮助(This is a create BP neural network matlab source code, including the creation of BP neural network, curve fitting and so on. Very helpful for beginners)

说明：  该程序可以建立一个链表，然后随机的插入节点(The program can build a linked list, and then randomly insert the node)

被控对象为三阶系统，可以根据M的参数设置演示低通滤波效果，控制部分采用PID控制。(Third-order system for the controlled object, you can set the parameters according to M shows low-pass filtering effect, the control part of the PID control.)

Demo Test Demo Test

matlab 经典教程 从入门到精通 实例讲解 非常经典 值得收藏(matlab classic tutorial on the very classic examples from entry to the proficient worth collecting)

太阳能光伏经过整流再进行并到交流电网的平台搭建(Solar photovoltaic is rectified and then built on the platform of alternating current network)

0-1整数规划有很广泛的应用背景，比如指派问题，背包问题等等，实际上TSP问题也是一个0-1问题，当然这些问题都是NP问题，对于规模较大的问题用穷举法是没有办法在可接受的时间内求得最优解的，本程序只不过是一个练习，得意之处是用递归法把所有解都排列出来。另：胡运权所著的《运筹学基础及应用（第三版）》第97页的例3，我用本程序求解得到的结果是：最优解是x*=(1,0, 0, 0, 0)，最优值是f(x*)=8，但书求得最优解是x*=(1,0, 1, 0, 0)，最优值是f(x*)=4，是不是书中写错了，请大家验证。以下是源程序，大家可以任意使用无版权问题，另外，如果大家有大规模的0-1规划的问题也希望提供给我，谢谢。变量个数至少是3个(0-1 Integer Programming is a very broad background, such as assignment, bags and so on. actually TSP is a 0-1, of course, these problems are NP, for larger problem with the law is not exhaustive approach in an acceptable time frame to obtain the optimal solution. this procedure is only one practice, farewell tour is the method used recursive all of the solutions to show. Another : Hu Yun-author of "operational research, and application base (third edition)" Article 97 of the three cases, I use this procedure to solve the result is : is the optimal solution x = (1,0, 0, 0, 0), the optimal values of f (x*) = 8, but the book is to find the optimum solution x = (1,0, 1, 0, 0), the optimal values of f (x*) = 4, the book is not a mistake, please certification. Following is the source)

城市规划计算机仿真，元胞自动机，MATLAB实现(Urban planning computer simulation, cellular automata, MATLAB implementation)