登录
首页 » matlab » Mie

Mie

于 2009-10-06 发布 文件大小:1KB
0 252
下载积分: 1 下载次数: 106

代码说明:

  Mie散射计算,另包含相对尺度和复折射率的计算程序(Mie scattering calculations, and contains the relative scale and complex refractive index of the calculation program)

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

发表评论

0 个回复

  • CP0202
    本代码实现了利用matlab仿真产生PAM-DS-UWB发射波形的过程。(The code generated by using matlab simulation launch PAM-DS-UWB waveform process.)
    2011-05-09 09:44:09下载
    积分:1
  • monte-carlo-simulation
    实现门特卡罗算法 解题过程可以归结为三个主要步骤:构造或描述概率过程;实现从已知概率分布抽样;建立各种估计量。 (about monte carlo simulation)
    2012-04-17 22:28:55下载
    积分:1
  • insert-Chinese-map_matlab
    matlab 画图时,用于插入中国地区的地图(insert Chinese map, when using Matlab)
    2014-09-28 09:55:01下载
    积分:1
  • MATLAB
    Nyquist Graph Rutine
    2011-12-06 09:38:19下载
    积分:1
  • shecishibie
    这是一个关于舍此识别的一个matlab程序,可以识别舍此的位置。(This is a about the recognition of a matlab program that can identify the alternative location.)
    2015-03-26 23:18:26下载
    积分:1
  • Steganography_Against_RSandGPC
    一种改进的LSB Steganography 以抵抗“RS分析法”和GPC Steganalysis(LSB Steganography against RS and GPC)
    2015-12-24 20:46:40下载
    积分:1
  • repoet3-4
    Even though the RAND functions can be useful for generating uniform random numbers, most of the time we will need to model various non-uniform distributions, such as the Normal, Lognormal, Exponential, Gama, and others. In fact, the Uniform distribution arises in a very limited number of applications, so the chances are our worksheet models will rarely deal with this distribution
    2013-03-14 15:32:20下载
    积分:1
  • TrackRoute
    用路径跟踪法求解不等式约束的凸二次规划,即沿着此路径(或邻域)可以逼近问题的最优解。(With the path tracking method for solving inequality constrained convex quadratic programming, that along this path (or neighborhood) can approximate the optimal solution of the problem.)
    2013-11-23 14:31:30下载
    积分:1
  • gradient descent
    说明:  梯度下降法是一個一階最佳化算法,通常也稱為最速下降法。 要使用梯度下降法找到一個函數的局部極小值,必須向函數上當前點對應梯度(或者是近似梯度)的反方向的規定步長距離點進行疊代搜索。如果相反地向梯度正方向疊代進行搜索,則會接近函數的局部極大值點;這個過程則被稱為梯度上升法。(The gradient descent method is a first-order optimization algorithm, also commonly referred to as the steepest descent method. To find the local minimum of a function using the gradient descent method, an iterative search must be performed to the specified step distance point in the opposite direction of the gradient (or approximate gradient) of the current point on the function. If the search is reversed in the opposite direction to the positive direction of the gradient, it will approach the local maximum point of the function; this process is called the gradient ascent method.)
    2019-02-21 23:13:19下载
    积分:1
  • moxin
    最短路算法一例题, (The superior calculate way that incises a square body returns to row with the dynamic state )
    2010-06-18 22:24:50下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载