-
SetAccessData
对已经存在的Accsess数据库表添加新字段并复值(right Accsess already existing database table and add a new field of Complex)
- 2006-08-10 21:15:31下载
- 积分：1
-
同伦法解方程
同伦算法解方程，附带外文资料，有测试代码和我自己修改的(Homotopy algorithm for solving equations, with foreign data, test code and I modified it.)
- 2018-04-22 15:08:22下载
- 积分：1
-
PMSG
永磁同步电机Simulink模型，参数自己设置(Permanent magnet synchronous motor Simulink model, the parameters need to set their own)
- 2021-02-03 13:19:59下载
- 积分：1
-
EasyBuy_01
易买网项目源码，全部功能都实现。欢迎大家下载！(Easy to buy network project source code, all functions are realized)
- 2020-06-19 00:40:02下载
- 积分：1
-
高等教育出版社 电路 第四版 低9 10 11 章
高等教育出版社 电路 第四版 低9 10 11 章-ppt for dianlu 9 10 11
- 2022-08-21 20:16:09下载
- 积分：1
-
Ispindel固件。用于控制Craftbeerpi firmware
Firmware Ispindel. for control of craftbeerpi
- 2020-06-21 00:00:02下载
- 积分：1
-
naoplaygolf
说明： nao机器人软银杯比赛代码，希望对大家有所帮助。(Nao Robot Soft Silver Cup Competition Code)
- 2020-06-18 02:00:02下载
- 积分：1
-
ARetargetableCCompiler
lcc书籍的中文翻译.详细介绍lcc的源代码,数据结构等.是用来分析lcc源代码的最佳工具.(LCC books in Chinese translation. Details LCC source code data structure. LCC is used to analyze source code for the best tools.)
- 2020-10-04 17:37:39下载
- 积分：1
-
TwIST_v2
说明： 迭代收缩/阈值（IST）算法是近年来提出的一类凸无约束优化问题和其它线性逆问题的一种新方法。这类问题是将线性观测模型与非二次正则化器（例如，全变差或基于小波的正则化）相结合的结果。这些算法的收敛速度很大程度上取决于线性观测算子的条件，当该算子病态时收敛速度变慢。(Iterative shrinkage/thresholding (IST) algorithms have been recently proposed to handle a class of convex unconstrained optimization problems arising in image restoration and other linear inverse problems. This class of problems results from combining a linear observation model with a non-quadratic regularizer (e.g., total variation, or wavelet-based regularization). It happens that the convergence rate of these IST algorithms depends heavily on the condition of the linear observation operator, becoming very slow when this operator is ill-conditioned.)
- 2020-12-12 19:29:38下载
- 积分：1
-
AT91SAM7S256开发板基础demo，已验证
AT91SAM7S256开发板基础demo，已验证-AT91SAM7S256 development board based on demo, verified
- 2022-08-15 22:38:14下载
- 积分：1
|
联系客服（QQ：3324461878）
