-
ACM Nankai University in 2008 summer training camp, the early sharing of code
南开大学2008年暑期ACM集训,初期共享代码-ACM Nankai University in 2008 summer training camp, the early sharing of code
- 2022-06-28 09:39:01下载
- 积分:1
-
经典微波电磁散射模型MIMICS
乌拉比创立的微波电磁散射模型,主要用于电磁波在植被覆盖区域的计算,用于高大植被覆盖区,将植被分成树冠,树干和地面三个部分,分别计算电磁散射,是目前最经典精度最高的电磁散射模型。
- 2022-03-23 15:10:07下载
- 积分:1
-
北大ACM试题poj 第3061题源码,很好的代码,希望对搞ACM的同学有帮助...
北大ACM试题poj 第3061题源码,很好的代码,希望对搞ACM的同学有帮助
-Peking University ACM Chapter 3061 question Question poj source code, good code, and want to help students engage in ACM
- 2022-03-02 13:20:30下载
- 积分:1
-
人工智能归结反演算法
这是人工智能当中的归结反演的算法实现代码
- 2022-08-31 13:15:03下载
- 积分:1
-
用差分方法求解沃尔泰拉方程,此处为一个变元的方程,由于该方程同时含有微分和积分,一般求解有一定的困难。...
用差分方法求解沃尔泰拉方程,此处为一个变元的方程,由于该方程同时含有微分和积分,一般求解有一定的困难。-use of the finite difference method for Volterra equation here as a variable element of the equation, As the same time contain differential equations and integral, the general solution is definitely difficult.
- 2022-11-10 09:55:02下载
- 积分:1
-
Canny 边缘检测
Canny 1986 年由约翰 F.Canny 开发的。此外认识到许多如优化探测器,Canny 算法的目的是满足三个主要标准
- 2022-04-02 12:20:48下载
- 积分:1
-
多元散射校正算法,用于近红外散射数据处理,增强信噪比
多元散射校正算法,用于近红外散射数据处理,增强信噪比-function [Xcorrect]=msc(X,Xref)
msc pretreate the samples X with the Multiplicative Scatter Correct
Input
X:the matrix of the sample spectra to be Correct
Xref:the matrix of the sample spectra to be ref
Output
Xcorrect:the sample spectras was Corrected from the X
Programmer: zhimin zhang @ central south university on dec 13 ,2007
Reference: Chemometrics and Intelligent Laboratory Systems 29 (1995) 233-241
- 2023-09-03 21:40:03下载
- 积分:1
-
对选择的图片进行傅立叶变换,并且显示出处理后的图片。
对选择的图片进行傅立叶变换,并且显示出处理后的图片。-Select the picture on the Fourier transform.
- 2022-09-30 23:00:04下载
- 积分:1
-
这是我收集的一个老外编的最小二乘法拟合椭圆算法。希望能派上用场。...
这是我收集的一个老外编的最小二乘法拟合椭圆算法。希望能派上用场。-This is my collection of a foreigner series of the least squares fit algorithm for elliptic. Hope can be put to use.
- 2022-04-18 01:32:13下载
- 积分:1
-
旅行商问题,即TSP问题(Travelling Salesman Problem)是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市,他必须选择所要走的...
旅行商问题,即TSP问题(Travelling Salesman Problem)是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市,他必须选择所要走的路径,路经的限制是每个城市只能拜访一次,而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。
-Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) is a well-known field of mathematics problems. Assuming there is a travel business to visit n cities, he must choose which path to go, via the restriction is to visit each city only once and the last to go back to the original departure city. Path selection objective is to get the path distance for all paths are the minimum.
- 2022-06-21 21:53:25下载
- 积分:1