搜索资源列表
IniSnake
- 一个自己写的设置SNAKE初始节点的MATLAB程序,以绿色十字标记节点位置,在此基础上可以编制自己的SNAKE算法,-himself wrote a set of Snake initial nodes MATLAB procedures to Green Cross markings node location, on this basis can prepare their own Snake algorithm, huh
four-nodes-matlab-fem-program
- 四节点矩形单元matlab有限元程序，使用于一般通用程序-four nodes rectangular modules Matlab finite element program, the use of common procedures in
MATLAB实现拉格朗日、分段线性、三次样条三种插值的方法
- MATLAB实现拉格朗日、分段线性、三次样条三种插值的方法，改变节点的数目，对三种插值结果进行初步分析,MATLAB realization of Lagrange, piecewise linear, cubic spline interpolation in three ways, changing the number of nodes, interpolation of three preliminary analysis of the results
Hermite.rar
- Hermite插值，不少实际问题不但要求在节点上函数值相等，而且要求他的导数值也相等,Hermite interpolation, a lot of practical problems requires not only the function values in the nodes are equally divided, but also his value is also equal to I.
simulation.rar
- 排队论中M/M/1系统的MATLAB仿真主要是阻塞率的理论值与仿真数据的比较,M/M/1 queuing theory in MATLAB simulation system is blocking the theoretical value of the comparison with the simulation data
dvhop.rar
- 主要介绍了dvhop算法的源代码，先计算平均每跳的距离，再根据跳数求出锚节点与未知节点的距离，再用三边测量法求出未知节点坐标,Dvhop algorithm introduces the source code, to calculate the average distance of each jump, then jump a few calculated in accordance with anchor nodes and unknown distance from the node,
wsn-simulation-in-matlab
- Wireless Sensor Networks (WSN) is different than the Cellular Networks as I mentioned earlier. A WSN is composed of a large number of sensor nodes that communicate using a wireless medium (air). The sensor nodes are deployed randomly in the envir
flowofdistribution33nodes
- 此程序为MATLAB实现的配电网33节点潮流计算，方法为前推回代法。-MATLAB realization of this program for the distribution network 33 nodes in power flow calculation, and methods for the former to push back on behalf of the law.
DistributionFlow
- 采用前推回代法计算配电网潮流的程序，同时给出了IEEE33节点的算例-Using forward and backward substitution method to calculate distribution power flow program, and gives examples of nodes IEEE33
simulation
- 对一个50个结点（更多的节点的网络只需要修改模块中的标量维数就行）的复杂非线性耦合网络进行同步化仿真。首先生成K矩阵，然后运行simulink，即可得到50个洛仑兹混沌节点复杂网络的同步化曲线。-Of a 50-node (more network nodes only need to modify module scalar dimension on the line) the complexity of nonlinear coupling network synchronization s
DRSSI
- 针对煤矿井下巷道狭长，信号多径效应明显，接收信号强度（RSSI）测距算法受井下环境影响大，定位精度低的情况，提出了一种信标节点链式部署结构下的动态RSSI测距算法，该算法以信标节点间的距离和它们间测量到的RSSI值为参考，计算巷道内实际环境下的路径衰落指数，以提高RSSI测距算法对环境的适应性。-A dynamic RSSI location algorithm is proposed based on the beacon nodes chain deployment of tunnel Wi
compensation
- 关于无功补偿的matlab优化程序，节点较多，可自己改动-Reactive power compensation on the matlab optimization procedures, more nodes can change their own
bp3
- 三层前馈神经网络的BP算法。程序具有以下功能： （1） 允许选择各层节点数； （2） 允许选用不同的学习率η； （3） 能对权值进行初始化，初始化用[-1、1]区间的随机数； （4）允许选用单极性和双极性两种不同Sigmoid型转移函数。 -Three-tier feed-forward neural network BP algorithm. Procedures have the following functions: (1) allows to choose the
DVHOP
- 实现DV-Hop定位算法的仿真,自动生成一定节点数的随即分布图，给出仿真结果的各点定位误差，用曲线图形显示，并可以计算平均误差。-DV-Hop simulation. Produce a randomly distributed nodes and then simulate and give the location error of each node, showing it in figure, and calculate the average error.
Sensor_air
- Matlab based wireless sensor network code for hetrogeneous application in Airports. This is based on clustering of nodes.
MATLAB-Code-for-Simulated-Annealing
- TSP can be defined as a problem where starting from a node it is required to visit every other node only once in a way that the total distance covered is minimized. After an initial solution a neighborhood solution is selected by an exchange of a ran
d009_dyn
- 标准9节点psat动态模型，包含模型描述以及simulink下搭建的模型-9 nodes psat standard dynamic model, including model descr iptions and model structures under simulink
8-nodes
- 8节点的前推回代法潮流程序，可以计算配电网的潮流。-8 nodes matlab power flow
6节点Matlab直流潮流程序
- 实现6个节点的直流潮流计算，功能已经得到验证。(DC power flow program of 6 nodes)
网络抗毁性，MATLAB仿真
- Matlab中对建立好的网络进行节点/连边随机、蓄意攻击，用最大连通子图、网络效率来衡量网络的抗毁性，并找出最关键的节点的仿真程序。(In MATLAB, the nodes / edges of the established network are attacked randomly and intentionally. The invulnerability of the network is measured by the maximum connectivity sub graph a