登录
首页 » matlab » Grating-diffraction

Grating-diffraction

于 2013-04-04 发布 文件大小:449KB
0 385
下载积分: 1 下载次数: 18

代码说明:

  光栅衍射的强度和条纹。光栅的光学实验中有着分光、压缩脉冲等重要作用。研究它有重要的意义。(Grating diffraction intensity and stripes. Spectral the grating optical experiments have, the compressed pulse an important role. Research it has important significance.)

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

发表评论

0 个回复

  • k_means-matlab
    matlab语言实现的k-means算法,用于对数据对象进行分类。(matlab language of the k-means algorithm to classify the data objects.)
    2010-07-24 09:24:16下载
    积分:1
  • Utility_vs_price
    Code to determine the relationship between utility and price in a cooperative network
    2013-07-13 03:17:39下载
    积分:1
  • K-MEANS
    简单的K均值聚类函数,用于求算重心的函数,算法高效快速(Simple K-means clustering function for calculating the center of gravity function, the algorithm is fast and efficient)
    2012-07-10 10:39:17下载
    积分:1
  • lic
    License from matlab 2017a
    2019-05-23 12:51:07下载
    积分:1
  • simulation-of-light
    书籍:高等光学仿真-光波导激光,通过具体例子展示matlab的强大功能(Books: higher- optical waveguide laser optical simulation, through specific examples show the powerful functions of matlab)
    2016-06-03 22:34:25下载
    积分:1
  • digital_image_process_matlab_codes
    用matlab对照片进行频域变换,并进行简要分析比较DCT、DFT、WH等方式重构的图像与原始图像之间的差别,并写出报告(use matlab to perform the frequence transform and use DCT/DFT/WH to rebuild the picture, analysis the difference and report)
    2009-11-28 00:51:58下载
    积分:1
  • Grey-prediction[GM(1
    灰色预测[GM(1,1) ]MATLAB程序(已经测试运行)(Gray prediction [GM (1,1)] MATLAB program (test run))
    2012-08-31 08:05:45下载
    积分:1
  • extractForeground
    Fast video loading code do background subtraction subtracting all frames from first frame and show the result video so fast
    2013-10-30 13:37:26下载
    积分:1
  • peerpressure
    peer pressure聚类算法 可以实现社会网络的简单聚类分析。(peer pressure clustering Algorithm)
    2013-12-03 16:35:04下载
    积分:1
  • jcbb-simulation.tar
    analyze data association algorithms (Nearest Neighbour and JCBB) in SLAM. Data association is basically a combinatorial optimization problem whose goal is to find the “best” set of associations between the observations and predictions according to a particular criterion (e.g. individual compatibility). Form this point of view, near- est neighbour (NN, a.k.a. ML) is simply a “greedy” algorithm in which the “compatibility” of individual associations with each other is not examined. On the contrary, JCBB, by considering both the individual and joint compatibility, is able to yield much better results. JCBB uses the branch and bound technique in order to prune the search tree
    2012-11-30 17:07:01下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载