-
kk
说明: 微分进化算法中的其中两个子程序,还有未上传(Differential evolution algorithm)
- 2019-07-20 21:29:49下载
- 积分:1
-
norton-power-law
牛顿幂率蠕变法则的一个子程序-是一个经典的、常用的蠕变法则,在众多领域广泛使用(Newtonian power law creep rate of a subroutine- is a classic, conventional creep law, are widely used in many fields)
- 2021-04-01 20:49:08下载
- 积分:1
-
polyfit
该程序用来对多种物质混合物吸收光谱数据进行分析,拟合出光谱曲线并且得到其各个峰值位置所在。(The program is used for a variety of mixtures of substances absorption spectral data analysis, curve fitting, and by their spectral location of each peak.)
- 2010-01-07 06:28:52下载
- 积分:1
-
Chapter7
fortran cases for BEM
- 2017-12-19 14:06:44下载
- 积分:1
-
istft
说明: 短时傅里叶变换及短时傅里叶反变换的实现,简单可用(The realization of short-time Fourier transform and short-time Fourier inverse transform is simple and available)
- 2019-12-03 20:30:24下载
- 积分:1
-
LinearBarElement
有限元中LinearBarElementStiffness的matlab(FEA LinearBarElementStiffness)
- 2013-10-11 20:26:21下载
- 积分:1
-
EX2
利用有限元理论,求一二维梁的固有频率和振型。短边固定,给定长度、横截面积,弹性模量及材料密度已知。并对比理论计算结果进行分析。各参数自己设定。(Using finite element theory, seeking a two-dimensional beam natural frequencies and modes. The short side is fixed, given the length, cross-sectional area, modulus of elasticity and density of the material is known. And compare the theoretical calculation results were analyzed. Each parameter set.)
- 2012-11-19 18:55:57下载
- 积分:1
-
贝叶斯聚焦算法IEEE Bayesian-Focusing
最新的关于贝叶斯聚焦算法IEEE文章。该算法通过利用信号DOA概率密度函数实现加权的阵列波前差值法,能实现宽带相干信号的DOA估计,并能减小阵列聚焦误差,提高宽带阵列频域波束形成鲁棒性。(In this paper, we present and study a Bayesian focusing transformation (BFT) for coherent wideband array processing, which takes into account the uncertainty of the direction
of arrivals (DOAs). The Bayesian focusing method minimizes the
mean-square error of the transformation over the probability densityfunctions(pdfs)oftheDOAs,thusachievingimprovedfocusing
accuracy over the entire bandwidth)
- 2021-04-07 23:19:01下载
- 积分:1
-
实验1
利用不动点迭代和牛顿迭代求解非线性方程解的理论(Theory of Solving Nonlinear Equations by Fixed Point Iteration and Newton Iteration)
- 2019-05-07 16:56:30下载
- 积分:1
-
5
★问题描述:
给出平面上的N 个二维点,求出距离最小的2 个点对。本题中距离定义为他们的直
线距离。例如(0,0) (3,4)的距离为5.
★数据输入:
有多组数据,对于每组数据,第一行是一个数字N 表示点的个数。N=0 的时候说明
输入结束。之后N 行,每行有2 个浮点数x_i,y_i 表示第i 个点的坐标。(1<=N<=10000
0,0<=|x_i|,|y_i|<=10^9)
★结果输出:
输出一个浮点数,表示最近点对的距离除以2,保留2 位小数(四舍五入)。
- 2013-12-03 14:57:02下载
- 积分:1