登录
首页 » matlab » FDTD_Shengzijingti

FDTD_Shengzijingti

于 2008-03-26 发布 文件大小:2KB
0 133
下载积分: 1 下载次数: 368

代码说明:

  详细介绍了声子晶体的带隙计算和传输特性,包含声子晶体的计算源程序。内有文件注释。(Details of the phononic crystal band gap calculation and transmission characteristics, including the calculation of phononic crystal source. There are paper notes.)

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

发表评论

0 个回复

  • cnn_gear_raw
    1dCNN 用于分类,使用一维的CNN,和相应的一维数据输入和卷积核,对一维信号数据进行处理(use 1dCNN for fault classification)
    2021-01-13 19:58:49下载
    积分:1
  • open-data
    读取文件。给出一个txt文件(水准数据)利用openfile 语句读取每一行的文件,再读入数据库。(Read the file. Gives a txt file (level data) to utilize openfile statement reads each line of the file, and read it into the database.)
    2012-12-15 23:43:59下载
    积分:1
  • 三相有源电力滤波器非线性滑模控制_李万军
    说明:  三相有源电力滤波器非线性滑模控制文章还不错(Nonlinear Sliding Mode Control of Three-phase Active Power Filter)
    2020-06-24 22:40:01下载
    积分:1
  • Propeuurties
    c++Primer书籍电子版,让读者可以在电脑或者手机方便的阅读。(C++ Primer Book Electronic edition, so that readers can easily read on the computer or mobile phone.)
    2020-06-24 19:20:02下载
    积分:1
  • baldwin1993
    说明:  baldwin1993 research on it
    2020-06-18 17:40:02下载
    积分:1
  • 易语言编写的希网域名更新程序,可以随便更改源码
    易语言编写的希网域名更新程序,可以随便更改源码-xiwangyuminggengxinchengxu
    2023-05-23 17:15:02下载
    积分:1
  • inception_v3_2016_08_28.tar
    说明:  that si inception network for tf
    2019-05-06 21:18:42下载
    积分:1
  • 遗传算法求解多旅行商问题
    说明:  旅行商问题(TravelingSalesmanProblem,TSP)是一个经典的组合优化问题。经典的TSP可以描述为:一个商品推销员要去若干个城市推销商品,该推销员从一个城市出发,需要经过所有城市后,回到出发地。应如何选择行进路线,以使总的行程最短。从图论的角度来看,该问题实质是在一个带权完全无向图中,找一个权值最小的Hamilton回路。由于该问题的可行解是所有顶点的全排列,随着顶点数的增加,会产生组合爆炸,它是一个NP完全问题。(Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem. The classic TSP can be described as: a merchandiser sells goods to several cities. The salesman starts from a city and needs to go through all the cities and return to the starting point. How to choose the route of travel so that the total journey is the shortest. From the point of view of graph theory, the essence of the problem is to find a Hamilton loop with the smallest weight in a completely undirected graph with weights. Since the feasible solution to this problem is the full permutation of all vertices, as the number of vertices increases, a combinatorial explosion occurs, which is an NP-complete problem.)
    2020-06-17 11:00:02下载
    积分:1
  • FIR等波纹滤波器设计与实现
    说明:  自己写的等波纹滤波器,比较适合初学者,简单易懂,同时还有一定说明(Matlab code of automatic gain controller written by myself is easy to understand and suitable for beginners)
    2021-02-16 15:59:46下载
    积分:1
  • jsdetectmine
    一个仿windows的扫雷程序,写的不错,很有参考价值,可以看一下(a windows-like detect mine game)
    2012-10-31 08:34:26下载
    积分:1
  • 696518资源总数
  • 105877会员总数
  • 14今日下载