-
iec104
104规约程序,用于电力IEC104规约分析(104PROTOCAL)
- 2010-01-11 15:00:59下载
- 积分:1
-
work2
09年cumcm B题程序,统计出住院信息,数值模拟等, 有一定价值(the progress of CUMCM,B,2009)
- 2010-01-22 10:46:50下载
- 积分:1
-
neural-network-handouts
神经网络讲义,共八讲,主要讲述了神经网络发展史以及几个经典的人工神经网络(Neural network handouts, a total of eight speakers, mainly about the history of neural networks as well as several classic artificial neural network)
- 2013-08-19 21:34:09下载
- 积分:1
-
GIntegralm1
matlab code of calculated f dos of graphene
- 2012-07-25 21:13:33下载
- 积分:1
-
sourcecode
《MATLAB实用教程》 MATLAB例程源代码 可作为电子、通信、自控等专业本科生研究生及广大科研人员的参考。
(" MATLAB Practical Tutorial" MATLAB routine source code can be used as electronics, communications, self-control and other professional researchers undergraduate students and the general reference.)
- 2010-03-01 01:58:49下载
- 积分:1
-
EWB
说明: EWB中元器件的详细讲解实用的很啊!洗完喜欢!(EWB in the components explained in detail)
- 2010-04-19 10:27:29下载
- 积分:1
-
Matlab_function
matlab 日常使用函数大全
可以参考使用 HTML格式(Encyclopedia of everyday use matlab function can refer to the use of HTML format)
- 2021-02-21 09:39:42下载
- 积分:1
-
ncorr_v1
matlab/C++ 源代码,在数字相关技术中应用非常高效准确。(matlab/C++ source code in digital image correlation. It s very useful and convenient)
- 2013-10-15 02:12:08下载
- 积分:1
-
66745
The following Matlab project contains the source code and Matlab examples used for inverse kinematics for a 3dof robot arm. authors michael miranda and renato salinas. Uses optimization to find the spatial location of each axis articulator.
- 2015-03-12 11:10:02下载
- 积分: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