Dynamic-Matrix

vector controle of the induction machine

说明：  otsu自适应阈值分割 用于图像分割二值化(otsu adaptive thresholding segmentation for image binarization)

求取Multi-Dimensional Maximally Stable Extremal Regions，下载于美国加利福尼亚大学洛杉矶分校(strike Multi-Dimensional Ex Maximally Stable tremal Regions, downloads in the United States the University of California at Los Angeles)

解决背包问题 自动求解最大价值 利益最大化问题(Automatically solve the Knapsack Problem to maximize the interests of maximizing the value of solving the problem)

matlab code for robot command using fuzzy analysis

该模型是基于虚拟磁链的空间矢量控制，作相关研究的人可以看一下(The model is based on virtual flux space vector control, as related research people can look at)

matlab程序实现下面的功能：过程的输入驱动采用M序列，即u(k)是一个M序列。过程传递函数G(s)中K=120，T1=8.3Sec，T2=6.2Sec。过程的脉冲响应理论值g(k)满足。根据过程的输入输出数据u(k)和z(k)，利用相关分析算法估计出过程的脉冲响应值g2(k)，并且有。(Process input is driven by the M sequence, i.e., u (k) is an M sequence. Process transfer function G (s) K = 120, T1 = 8.3Sec T2 = 6.2Sec. The impulse response of the process of the theoretical value of g (k) meet. According to the process input and output data u (k) and z (k), the estimated impulse response of a process value g2 (k), and the correlation analysis algorithm.)

matlab作业题中的应its application of matlab and the its application of matlab and the its application of matlab and the its application of matlab and the coursework(its application of matlab and the its application of matlab and the its application of matlab and the its application of matlab and the coursework)

旅行商问题，即TSP问题（Travelling Salesman Problem）又译为旅行推销员问题、货郎担问题，是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) also translated as the traveling salesman problem, traveling salesman problem is one of the well-known problems in the field of mathematics. Suppose you have a travel business to visit n cities, he must choose which path to go, limiting the path is to visit each city only once, and the last to return to the original departure city. Select the destination path is the requirement for the minimum distance path was among all paths.)

说明：  矩量法解Hallen方程求线天线表面电流分布，E面方向图和辐射阻抗(Moment Method Solution of Hallen equation for wire antenna surface current distribution, E surface impedance and radiation pattern)