-
一个非常实用的c语言快速傅立叶变换程序,可以做傅立叶正变换和反变换
一个非常实用的c语言快速傅立叶变换程序,可以做傅立叶正变换和反变换-A very useful fast Fourier transform c language program, you can now make Fourier transform and inverse transform
- 2023-03-29 04:25:03下载
- 积分:1
-
马鞍点程序
资源描述
若矩阵Am´n中的某个元素aij是第i行中的最小值,同时又是第j列中的最大值,则称此元素为该矩阵中的一个马鞍点。试在顺序存储结构或链式存储结构的情况下,编程求出矩阵中所有的马鞍点。
- 2022-02-27 09:05:32下载
- 积分:1
-
选票程序
选票程序-ballot procedures
- 2022-03-10 08:46:58下载
- 积分:1
-
Clustering through Decision Tree Construction
Clustering through Decision Tree Construction - CLTree - A subspace clustering algorithm.-Clustering through Decision Tree Construction- CLTree- A subspace clustering algorithm.
- 2022-01-30 23:39:10下载
- 积分:1
-
超市管理系统
应用背景这是一个自己编写的学生超市管理系统,内容包括界面设计、数据库管理等等多个方面,是比较全面的超市管理程序关键技术用C++编写的程序,关机那技术就是MFC编写的界面和C++编写的程序,内部注释是比较详细的,很方便之后的理解
- 2022-05-17 15:45:00下载
- 积分:1
-
python GMM
python版本的混合高斯实现
- 2022-11-15 19:50:03下载
- 积分:1
-
这是一个计算编程的方法。梯形一体化的分…
这是一个计算方法的编程。是关于复化梯形积分的程序,在这里我们可以实现对你需要的梯形求面积。-This is a calculated method of programming. Minute of trapezoidal integration of the procedure, here we can achieve right you need to seek the trapezoid area.
- 2022-02-01 12:33:20下载
- 积分:1
-
dwt源代码有图可运行
最简单DWT水印源代码,可运行,供学习下载。进行毕业论文的设计,算法可再扩充,简单易懂,有详细介绍,可供初学者使用。
- 2022-02-04 08:22:17下载
- 积分:1
-
Sicily 1009梅森素数
One of the world-wide cooperative computing tasks is the "Grand Internet Mersenne Prime Search" -- GIMPS -- striving to find ever-larger prime numbers by examining a particular category of such numbers.
A Mersenne number is defined as a number of the form (2p–1), where p is a prime number -- a number divisible only by one and itself. (A number that can be divided by numbers other than itself and one are called "composite" numbers, and each of these can be uniquely represented by the prime numbers that can be multiplied together to generate the composite number — referred to as its prime factors.)
Initially it looks as though the Mersenne numbers are all primes.
Prime
Corresponding Mersenne Number
2
4–1 = 3 -- prime
3
8–1 = 7
- 2022-03-17 05:46:40下载
- 积分:1
-
天气决策树源代码
用Information
Gain构造决策树的方法。
计算各分支的熵
“晴”的分支含2个正例3个反例,所需期望信息量为:
M(天况为晴)=-2/5 * log2 (2/5)-3/5 * log2 (3/5)
= 0. 971 bits
“多云”的分支,含4个正例0个反例:
M(天况为多云)=0
“雨”的分支,含3个正例2个反例:
M(天况为雨)=-3/5 * log2 (3/5)-2/5 * log2 (2/5)
- 2023-03-06 04:15:04下载
- 积分:1