登录
首页 » 算法 » stm32_f105-07_f2_f4_usb-主机-device_lib

stm32_f105-07_f2_f4_usb-主机-device_lib

于 2022-10-20 发布 文件大小:139.11 kB
0 176
下载积分: 2 下载次数: 1

代码说明:

SMT32F系列 USB通信各类模式范例,包含AUDIO DFU DualCore HID MSC VCP详细的解说例程

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 神经网络
    应用背景aplikasi神经网络,为工作上syaraf tiruan数据网。关键技术计算机智能化,penalaran电脑,komputasi,INI tugas matakuliah
    2022-04-11 07:27:33下载
    积分:1
  • sdfvasdfvasvda
    2022-06-16 18:34:51下载
    积分:1
  • 常用算法的C程序。主要内容包括多项式的计算、复数运算、随机数的产生、矩阵运算、矩阵特征值与特征向量的计算、线性代数方程组的求解、非线性方程与方程组的求解、插值与
    常用算法的C程序。主要内容包括多项式的计算、复数运算、随机数的产生、矩阵运算、矩阵特征值与特征向量的计算、线性代数方程组的求解、非线性方程与方程组的求解、插值与逼近、数值积分、常微分方程组的求解、数据处理、极值问题的求解、数学变换与滤波、特殊函数的计算、排序和查找。-Commonly used algorithm of C procedures. Include polynomial terms, complex computation, random number generation, matrix operations, matrix eigenvalue and eigenvector calculations, linear algebra equations, nonlinear equations with the equations, interpolation and approximation, numerical integration, solving ordinary differential equations, data processing, for solving extremum problems, mathematical transformation and filtering, the calculation of special functions, sorting and search.
    2022-04-01 01:32:13下载
    积分:1
  • 克鲁斯卡尔算法
    资源描述 基于C++的求最小生成树克鲁斯卡尔算法,运行效率良好                  
    2022-02-03 02:12:33下载
    积分:1
  • kNN landsat
    KNN算法碳映射
    2022-03-13 15:07:39下载
    积分:1
  • 自己编的一个教师课程匹配程序,实现对教师新学期任课的指派。...
    自己编的一个教师课程匹配程序,实现对教师新学期任课的指派。-their series matching a teacher training program, realized the new semester of teachers assigned to the classroom.
    2022-02-07 01:40:14下载
    积分:1
  • atan function, because a lot of information communication systems, which rely on...
    atan函数,由于在通信系统中很多信息都是依赖相位信息得到,所以atan函数非常有用。-atan function, because a lot of information communication systems, which rely on phase information is therefore very useful function atan.
    2022-01-25 19:12:46下载
    积分:1
  • 第三章 栈与队列习题答案
    第三章 栈与队列习题答案-The answer of stack and queue
    2022-01-26 08:17:59下载
    积分:1
  • a description of the problem is : No. 1, 2, ..., n n clockwise direction by indi...
    约瑟夫问题的一种描述是:编号为1,2,…,n的n个人按顺时针方向围坐一圈,没人持有一个密码。一开始人选一个正整数作为报数上限值m,从第一个人开始按顺时针自1开始报数,报到m是停止报数。报m的人出列,将他的密码作为新的m值,从他在顺时针方向上的下一个人开始重新从1报数,如此下去,直至所有人全部出列为止。-a description of the problem is : No. 1, 2, ..., n n clockwise direction by individuals sitting around a circle, no one holding a password. One person started as a positive integer limits on the number of reported m, from the first individuals to embark on the clockwise from a few reportedly started, the report m is reportedly stopped a few. M reported out of the list of his password as a new value m, from a clockwise direction in the next re-started from a newspaper a few, like that, until the total of all listed so far.
    2022-02-03 16:31:48下载
    积分:1
  • 数值型货币的大写转换1(未完待续)
    数值型货币的大写转换1(未完待续)-numerical monetary capital of a conversion (to be continued)
    2022-01-25 16:28:00下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载