搜索资源列表
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
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,
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.
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
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.
wsn-topology
- 无线传感器网络随机分布节点，形成拓扑结构-WSN deploys nodes at random and gets the topology of WSN.
move_grid
- 基于网格划分的无线传感器网络节点动态部署算法，可查看任意步骤中节点数目的变化，可显示最终的部署结果-Mesh-based wireless sensor network node dynamic deployment algorithm, the steps to see any changes in the number of nodes, the deployment of the final results can be displayed
Read_uff
- matlab读取uff文件数据 Universal file generation from I-Deas for Test can be split into two categories: export of model file data and export of adf data. It is not possible to write both sets of data to a single file. Written with a model file univers
mcmc
- matlab MCL（蒙特卡罗）仿真，移动节点-matlab MCL (Monte Carlo) simulation, mobile nodes
NetwonR
- 牛顿拉夫逊法潮流计算程序，已测试40个节点，内附参考结果和典型系统的描述，很全的资料-Newton Raphson power flow program, 40 nodes have been tested, the results and typical system containing a reference to the descr iption, it is all the information
Dijkstra
- 最短路径的Dijkstra算法程序。Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。 Dijkstra算法是很有代表性的最短路算法，在很多专业课程中都作为基本内容有详细的介绍，如数据结构，图论，运筹学等等。 -The Dijkstra shortest path algorithm for the proce
zuoye
- 利用有限差分法 (Finite Differential Method, FDM)将场域离散为许多小网格，应用差分原理，将求解连续函数的泊松方程问题转换为求解网格节点上的差分方程组的问题。-The use of finite difference method (Finite Differential Method, FDM) will field for many small discrete grid, the application of differential principle, t
game1
- 最好邻居选择策略来改善移动自组织网络中自私节点的合作行为，通过matlab做的仿真实验。-Best neighbor strategy to enforce cooperation among selfish nodes in wireless ad hoc network
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
网络抗毁性，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