circlock

混沌时间序列 GP方法求关联维数和嵌入维数(Chaotic time series GP method )

用MATLAB写的，用Prim算法找出图中的最小支撑树，文件中有例子，有计算的结果，一看便懂。(Written in MATLAB, with the minimum support tree in the Prim algorithm to find a figure, file example, with the result of calculation, a see will understand.)

gmcalab 快速广义的形态分量分析，本程序的性能已经达到较高水平，光纤陀螺输出误差的allan方差分析，具有丰富的参数选项,仿真效率很高的，用MATLAB实现动态聚类或迭代自组织数据分析，阐述了负荷预测的应用研究,通过matlab代码。( gmcalab fast generalized form component analysis, The performance of the program has reached a high level, allan FOG output error variance analysis, It has a wealth of parameter options, High simulation efficiency, Using MATLAB dynamic clustering or iterative self-organizing data analysis, It describes the application of load forecasting, By matlab code.)

matlab语言解高等数学中的各种问题，并附有各个例题的程序。(matlab language of higher mathematics in the solution of various problems, with various examples of the procedures.)

说明：  数学建模国赛2016年D题，风电场运行状况分析及优化(Mathematical Modeling National Competition 2016 D Question)

找椭圆的中心，用得到了很多算法，可以借鉴！(Find the ellipse center, many algorithms have been used, you can learn!)

在无线信道的理论基础上，分析了Suzuki信道模型的结构原理，介绍了利用正弦波叠加法构成高斯序列，从而建立Suzuki信道数学模型的方法，并通过Matlab软件对其进行了仿真。(In the theory of radio channel based on the analysis of Suzuki channel model structure principle, describes the use of sine wave superposition method constitutes a Gaussian sequence, thereby establishing a channel model Suzuki method, and through its simulation Matlab software.)

说明：  基于强化学习的机器人寻路，以方格地图为环境(reinforcement learning apply in the robatics)

卫星返回地球的运动轨线示意图，做成动画，看着有动感。(Satellite to return to the Earth s movement trajectory diagram and create animation, looking at dynamic.)

1.Matlab里面没有提供直接以半径和圆心位置画圆的程序，该程序可以实现此功能，命令格式为：circle(radius,x0,y0, color ) 2.一种基于势函数的路径搜索算法，能实现有障碍物环境中指定起点和终点位置的最短路径搜索。(1.Matlab which does not provide the location directly in the center circle radius and the program, the program can achieve this functionality, the command format is: circle (radius, x0, y0, color ) 2.Potential function based on the path search algorithm, to achieve environmental obstructions start and end position specified in the shortest path search.)