登录
首页 » matlab » S参数反演法

S参数反演法

于 2019-04-09 发布 文件大小:16KB
0 190
下载积分: 1 下载次数: 5

代码说明:

  S参数反演,利用同轴博导法测出的S参数,用NWR方法反演出等效介电参数。(S parameter inversion)

文件列表:

S参数反演程序 .docx, 16310 , 2018-11-26
freespace1.m, 7571 , 2015-12-11
NRW.m, 3816 , 2015-01-12

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

发表评论

0 个回复

  • abaqus固体umat,内涵多个子程序连接uexpan
    说明:  abaqus固体umat,内涵多个子程序连接(ABAQUS solid UMAT, with multiple subprogram connections)
    2020-07-07 16:18:57下载
    积分:1
  • SVMforsignal
    说明:  将音频文件信息使用MFCC提取出来并用SVM训练(数据需自己加载)(The audio file information is extracted by MFCC and use SVM training (data need to be loaded by itself))
    2019-05-13 12:47:09下载
    积分:1
  • program
    说明:  餐饮企业的管理系统主要包括前台管理、后台管理、财务管理、报表打印等功能(Catering enterprise management system, including front desk management, backstage management, financial management, printing statements)
    2008-11-26 17:51:25下载
    积分:1
  • matlab代码
    说明:  文件包含PSO和APSO(自适应粒子群算法)matlab代码,求解混合整数规划的matlab代码(The file contains PSO and APSO (Adaptive Particle Swarm Optimization) Matlab code, Matlab code for solving mixed-integer programming)
    2020-09-06 16:42:18下载
    积分:1
  • m_4wr
    构建了三自由度四轮转向汽车的状态空间模型,可以直接进行时域、频域、稳定性等方面的控制(The state space model of three degree of freedom four wheel steering vehicle is constructed, which can be simulated directly in time domain, frequency domain, stability and so on)
    2020-09-13 15:17:57下载
    积分:1
  • jQuery流程设计器-网页在线版 v1
    WEB在线版的JQuery流程设计器,使用主流技术,开源免费。参考了很多相关流程设计器,现重新规划出一个真正好用和易于二次开发的流程设计工具,它具有【精巧、方便、实用】等优点,兼容:IE7++、Chrome、Firefox 等主流浏览器。
    2022-08-25 13:10:02下载
    积分:1
  • MOTO
    MOTO-V3Icopy手机电路图,学习先进思想的电路设计-MOTO- V3Icopy phone circuit, and to learn from the advanced thinking of the circuit design
    2022-03-16 01:21:27下载
    积分:1
  • this about value propagation in sensor network.
    this about value propagation in sensor network.-this is about value propagation in sensor network.
    2022-01-26 05:57:28下载
    积分:1
  • 局部搜索图着色
    说明:  图着色局部搜索,图着色问题(Graph Coloring Problem, GCP) 又称着色问题,是最著名的NP-完全问题之一。道路着色问题(Road Coloring Problem)是图论中最著名的猜想之一。 数学定义:给定一个无向图G=(V, E),其中V为顶点集合,E为边集合,图着色问题即为将V分为K个颜色组,每个组形成一个独立集,即其中没有相邻的顶点。其优化版本是希望获得最小的K值。(Graph Coloring Problem (Graph Coloring Problem, GCP), also known as coloring problem, is one of the most famous NP-complete problems. The Road Coloring Problem is one of the most famous conjectures in graph theory. Mathematical definition: Given an undirected graph G=(V, E), where V is the set of vertices and E is the set of edges, the graph coloring problem is to divide V into K color groups, and each group forms an independent set. That is, there are no adjacent vertices. The optimized version is to get the smallest K value.)
    2021-04-01 16:49:10下载
    积分:1
  • RC控制
    说明:  针对逆变器的并网THD的改善策略,可以在ccs中通过加入该重复控制RC的代码,来有效减少并网电流THD(For the improvement strategy of grid-connected THD of inverter, the code of repetitive control RC can be added in CCS to effectively reduce grid-connected current THD)
    2020-11-21 15:02:39下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载