-
这个算法可以很好的实现实现一元多项式的计算,包括其相加和相减,是用C语言编写的。...
这个算法可以很好的实现实现一元多项式的计算,包括其相加和相减,是用C语言编写的。-this algorithm can achieve very good achievement of one yuan polynomial, including its sum and subtract. using the C language.
- 2023-03-25 02:40:03下载
- 积分:1
-
DSP2407倒立摆模糊控制
基于DSP2407控制器对环形一级倒立摆的控制程序,采用模糊控制
- 2022-02-04 17:24:38下载
- 积分:1
-
匀速直线运动Swerling 0型目标的检测与跟踪
资源描述
1,产生一个100X100的噪声数据平面,每个单元的噪声幅度暂定为高斯分布(正态分布);
2,产生一个匀速直线运动的目标,目标的幅度是Swerling 0型;
3,将目标的幅度加入到噪声平面,目标位置的对应数据单元的幅度叠加目标的信号强度;
4,二维数据平面上做pfa=10-6的门限检测;画出检测后的平面结果;
5,对检测后的点迹平面,做kalman滤波跟踪处理;
- 2022-06-26 16:35:30下载
- 积分:1
-
用于大型对称稀疏线性系统方程的迭代求解程序
应用背景包可以被用为求解对称线性系统的方程可能干的大型有限元离散, ;对称线性方程组可以是对称正定(SPD)或对称不定。关键技术的线性迭代(Krylov子空间迭代)求解器包括的预处理共轭梯度(PCG)方法和对称准微小残留(SQMR)方法,跑车的迭代线性求解器,Jacobi型预条件和SSOR型预条件是采用。 ;
- 2022-07-19 16:44:56下载
- 积分:1
-
表格线打印算法C语言源程序
表格线打印算法C语言源程序-form lines Print algorithm C language source
- 2022-08-06 16:58:02下载
- 积分:1
-
PSO algorithm PSO
粒子群优化算法PSO-PSO algorithm PSO
- 2022-03-23 10:10:58下载
- 积分:1
-
C6713实验实例
用于C6713开发版的实验实例
- 2022-08-03 19:46:17下载
- 积分:1
-
用C++编写一个进行汉诺塔游戏的程序,只需要输入汉诺塔的层数,会自动计算如何进行搬运最简单...
用C++编写一个进行汉诺塔游戏的程序,只需要输入汉诺塔的层数,会自动计算如何进行搬运最简单-a programme that been writen by c++ which can calculate the simplest way to solve the hannuota game.
- 2022-03-04 17:34:38下载
- 积分:1
-
人脸追踪 FaceTrace
应用背景
人脸识别 人脸追踪
The software is provided under the terms of this licence stricly for
// academic, non-commercial, not-for-profit purposes.
// * Redistributions of source code must retain the above copyright notice,
// this list of conditions (licence) and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions (licence) and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * The name of the author may not be used to endorse or promote products
// derived from this software without specific prior written permission.
// * As this software d
- 2022-08-14 06:55:42下载
- 积分:1
-
the Capacitated Vehicle Routing Problem
The CVRP is a hard combinatorial optimisation problem. The scenario is that a set of depots contains goods to be delivered to customers by a fleet of trucks. Each customer wants a certain integer amount of goods called their demand and each truck can only carry a certain amount called its capacity. All trucks have the same capacity. The objective is to find a set of routes, one for each truck, which minimises the total distance travelled by all trucks (the 请点击左侧文件开始预览 !预览只提供20%的代码片段,完整代码需下载后查看 加载中 侵权举报
- 2022-06-15 10:54:51下载
- 积分:1