登录
首页 » Others » upwind

upwind

于 2013-10-26 发布 文件大小:1KB
0 212
下载积分: 1 下载次数: 3

代码说明:

  Method upwind for equation of advection 1d in Matlab

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • rbf
    模型不确定的RBF网络逼近 matlab6.5编写(RBF network model of uncertainty close to the preparation of matlab6.5)
    2009-03-30 10:25:13下载
    积分:1
  • sensor
    多传感器信息融合AND准则OR准则和单传感器的对比效果,以及ROC曲线图(multi sensor data fusion)
    2014-09-20 18:29:38下载
    积分:1
  • DeepMVS-master
    说明:  图像识别 安全帽检测 安全帽识别 用于安全帽的检测任务(Image recognition helmet detection helmet recognition for helmet detection task)
    2020-02-05 11:30:03下载
    积分:1
  • implementofLMS_Equalizer
    说明:  采用LMS算法的盲均衡仿真程序,挺简单的,大家可作为参考(using LMS blind equalization algorithm for the simulation program, quite simply, we can reference)
    2006-03-15 20:37:38下载
    积分:1
  • spring_jisuan
    弹簧设计GUI,通过输入要求得到弹簧的结构(Spring Design GUI)
    2012-06-05 10:44:27下载
    积分:1
  • Mimo-OFDM
    主要讲了空时编码,及Mimo-OFDM调制方式, Alamounti空时分组编码方法(Major topics of the space-time coding, and Mimo-OFDM modulation, Alamounti space-time block coding method)
    2015-01-07 20:44:04下载
    积分:1
  • Raised-Cosine-Filtering
    对平方根升余弦滤波器进行归一化处理,使得输出的信号更接近输入信号。(Normalized the square root raised cosine filter )
    2013-05-22 22:03:18下载
    积分:1
  • bienei_V6.4
    Gabor小波变换与PCA的人脸识别代码,可实现对二维数据的聚类,IMC-PID是利用内模控制原理来对PID参数进行计算。( Gabor wavelet transform and PCA face recognition code, Can realize the two-dimensional data clustering, The IMC- PID is using the internal model control principle for PID parameters is calculated.)
    2016-06-02 17:04:06下载
    积分:1
  • nspc
    是美国统计学家萨尔斯伯格以“女士品茶问题”为切入点所著的一部关于统计学历史与变革的书,以一种全新的视角带领读者进入统计学的世界,体会统计学带给哲学观、宇宙观的变革(Salthe Berg statistician USA to Lady Tasting Tea problem as the starting point of a statistical history and change of the book, with a new view and lead the reader into the world of experience of statistics, statistics to philosophy, cosmic view change)
    2015-03-16 11:16:14下载
    积分:1
  • Centrality-measures
    文件包括:1.计算平均最短路径;2.计算每个顶点相邻节点的平均度;3.计算每个节点的邻近中心度;4.计算节点的介数(slow);5.计算节点的介数(faster);6.计算每条边的介数值;7.快速迪杰斯特拉算法;8.经典迪杰斯特拉算法。(1.the average shortest path in the graph 2.the average degree of neighboring nodes for every vertex 3.computes the closeness centrality for all vertices 4.node betweenness, (number of shortest paths definition) 5.a faster node betweenness algorithm 6.edge betweenness, (number of shortest paths definition) 7.simple Dijkstra, does not remember the path 8.Dijkstra which also returns the shortest paths.)
    2021-04-23 19:38:47下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载