-
wind_turbine_blade_coordinates_calculate
说明: 该code读出naca4412.txt中基本balde坐标,在读取data1.txt中设计要求,生成FinalCoordinates.txt文件,包含所有生成balde airfoil所需coordinates。(this matlab code read the blade coordinates in naca4412.txt, and then read the design requirements in data1.txt. Finally, it will generate the FinlCoordinates.txt which include all the coordinates of blade airfoil.)
- 2010-04-07 08:30:23下载
- 积分:1
-
wigner
该代码通过对常规单脉冲雷达信号、LFM雷达信号和BPSK雷达信号通过wiger变换,得到三种信号的时频图,分析他们的时频关系和区别。(The code on conventional single-pulse radar signals, LFM radar signals and radar signals BPSK wiger transformation, three kinds of time-frequency map analysis of their relationship and when the frequency difference.)
- 2010-05-27 14:35:54下载
- 积分:1
-
MC
说明: 关于蒙特·卡罗方法的一个简单算例;用来计算椭圆面积(Monte Carlo method)
- 2011-03-24 20:58:26下载
- 积分:1
-
Road-network-identification
该程序功能如下:
读取BMP或者JPG格式的图片,自动识别路网,并表出路口节点(The program functions as follows:
Read BMP or JPG format images, automatic identification of road network and junction node Expressed)
- 2014-12-28 19:02:17下载
- 积分:1
-
FDI3.3
a Matlab toolbox for parametric identification of fluid-memory models associated
with the radiation forces ships and offshore structures.
- 2014-01-30 22:42:59下载
- 积分:1
-
FC
说明: 简单的模糊控制器(Fuzzy Controller)的simulink仿真!(The simulation of fuzzy logic controller (Fuzzy Controller)!)
- 2020-11-09 18:49:47下载
- 积分:1
-
Mesh-Reconstruction-Algorithm--
提出利用电云进行模型重构的算法,该算法基于点云的几何形状特征,很好的算法。(Proposed the use of electric cloud model reconstruction algorithm based on the geometric shape of the point cloud, a good algorithm.)
- 2011-09-04 17:30:45下载
- 积分:1
-
PMSM_performace_comparision
Permanent magnet synchronous motor model in MATLAB
- 2010-10-16 10:37:29下载
- 积分:1
-
Dijkstra
说明: 最短路径的Dijkstra算法程序。Dijkstra算法是典型最短路算法,用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展,直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解,但由于它遍历计算的节点很多,所以效率低。
Dijkstra算法是很有代表性的最短路算法,在很多专业课程中都作为基本内容有详细的介绍,如数据结构,图论,运筹学等等。
(The Dijkstra shortest path algorithm for the procedure. Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the end date be extended to. Dijkstra shortest path algorithm can arrive at the optimal solution, but because of its calculation of the node traversal, so inefficient. Dijkstra algorithm is very representative of the shortest path algorithm, in many professional courses in the basic content as described in detail, such as data structures, graph theory, operational research and so on.)
- 2008-11-26 22:27:45下载
- 积分:1
-
SM_Sample
source code for matlab
- 2012-03-20 16:16:03下载
- 积分:1