-
fkaçfaf dfdsfsfds
- 2022-05-10 16:51:48下载
- 积分:1
-
In the basic role of half
在基础半正弦冲击作用下,硬特性刚度系统的冲击动态响应计算-In the basic role of half-sine shock, the hardware characteristics of stiffness of the system dynamic response calculation of the impact
- 2022-05-14 04:21:07下载
- 积分:1
-
数值分析第八版的负担和菲尔斯
Numerical Anaysis 8th Edition Burden and Faires
- 2022-03-11 13:44:04下载
- 积分:1
-
神经网络和智能信号处理
里面是很多智能算法的doc版资料,此外还有信号处理的方法.如BP,SOM,RBF,混沌神经网络等等,适合初学者
- 2022-07-13 05:33:26下载
- 积分:1
-
以优化SVM算法的参数c和g为例,对GSA(引力搜索算法)MATLAB源码进行了详细中文注解。是很好的学习材料。
以优化SVM算法的参数c和g为例,对GSA(引力搜索算法)MATLAB源码进行了详细中文注解。是很好的学习材料。
- 2023-02-05 22:30:04下载
- 积分:1
-
odd N bands Demon Lineup : N
奇数N 阶魔方阵问题: 奇数N 阶魔方阵的构造规则如下: 1、在第一行的正中间填入1; 2、如果左上角能够移动,则往左上角填入后继的数;如果左上角不 能移动,则顺移到该列最下方左边的一列中最靠近该列的位置; 3、如果左上角不能移动,同时在该列位置的最下方左边最靠近的位 置处也不能填入数,则往该位置的上一行的最右边的位置处填入 后继数; 4、每次尽可能地往左上角填数,如果发现左上角已经填满了数,则 从当前填的数的位置下方填上后继数。 要求: 无。 输入: 用户从键盘任意输入一个正奇数。 输出: 打印出该魔方阵。-odd N bands Demon Lineup : N-odd magic Lineup Construction Rules are as follows : 1, the first line is the middle of a preference; Two, if the upper left corner to Mobile, the successor to fill in the upper left; If the upper left corner, unable to move, with the move out of the bottom of the left one of the closest out of position; three, if the upper left corner, unable to move, while in the position shown in the bottom left nearest location Department has not entered a few, to the position of the party on the right side of the positions filled successor; 4, each possible to fill the upper left corner, if fill the upper left corner, has found a few, from the current fill several positions to fill in the bottom subsequent few. Requ
- 2022-01-21 19:39:47下载
- 积分:1
-
陀螺仪 加速度计 卡尔曼
基于卡尔曼滤波的陀螺仪与加速度计数据融合,采用C++编写将其封装成类,可用在角度测量应用。
- 2022-03-17 09:59:47下载
- 积分:1
-
利用KDD1999数据集进行K
利用KDD1999数据集进行K-means算法的实现-Mathimatics-Numerical algorithms
- 2022-02-04 02:05:42下载
- 积分:1
-
牛顿、拉格朗日、三次自然插值的演示文件。
牛顿、拉格朗日、三次自然插值的演示文件。-Newton, Lagrange, three natural interpolation Presentations.
- 2023-05-12 05:20:02下载
- 积分:1
-
有很多的算法,让您来处理信息存储…
There are numerous algorithms that allow you to manipulate the information stored in an array. Consider this function which allows you to determine the maximum value in an array of integers (could be easily adapted to find minimum value)-There are numerous algorithms that allow you to manipulate the information stored in an array. Consider this function which allows you to determine the maximum value in an array of integers (could be easily adapted to find minimum value)
- 2022-03-03 22:58:15下载
- 积分:1