登录
首页 » Python » 中文版第15页第一段提到的接口例子程序

中文版第15页第一段提到的接口例子程序

于 2020-06-25 发布
0 256
下载积分: 1 下载次数: 1

代码说明:

说明:  中文版第15页第一段提到的接口例子程序的学习代码(The learning code of the interface example program mentioned in the first paragraph of page 15 of the Chinese version)

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

发表评论

0 个回复

  • tongxunlu
    通讯录可以把通讯资料放到里面,是新建一个自己自定义的文件类型,然后再吧资料放到里面就可以,可以按照不同的搜索放噶搜索(Address Book can be placed inside the communication of information is a newly built their own custom file types, and then put it inside information can be released in accordance with the different search Kavalan search)
    2008-12-26 00:09:38下载
    积分:1
  • 10300337
    说明:  Boca Raton, FL Ph.D. Dissertation, Intelligent Monitoring and Switching Control of Unmanned Ground Vehicles, a University of Florida
    2020-06-23 14:40:02下载
    积分:1
  • Accelerator
    accelerator indicator
    2019-04-12 00:40:45下载
    积分:1
  • 随即点名 随即点名 随即点名
    随即点名 随即点名 随即点名-Was named immediately after the division was named the division
    2022-02-05 09:01:24下载
    积分:1
  • tracking
    移动机器人的轨迹跟踪算法,包括椭圆、园、直线、等(solve the non- holonomic restriction problem of trajectory tracking of the wheeled mobile robot.)
    2017-09-20 14:51:42下载
    积分:1
  • 股票市场预测
    说明:  LSTM 作为预测模型,使用贝叶斯优化算法来实现股票预测的功能(LSTM as a prediction model, uses Bayesian optimization algorithm to achieve the function of stock forecasting)
    2020-08-30 16:08:11下载
    积分:1
  • seva
    鼠标键盘录制回放p打开保存文件的类模块的源码(Mouse and keyboard recording playback p open class module of the source code for save the file)
    2017-04-16 14:06:08下载
    积分:1
  • ti-idf算法,实现对英文文档的检索,把多篇文档中的词(英文单词),按照权值从小到大进行排列...
    ti-idf算法,实现对英文文档的检索,把多篇文档中的词(英文单词),按照权值从小到大进行排列-ti-idf algorithm, the realization of the English document retrieval, to document more than words (English words), in accordance with the right values to be ranked from small to large
    2022-07-08 03:08:07下载
    积分:1
  • 复杂网络算法与应用源程序
    复杂网络构建模型,可能有小世界模型和无标度网络模型(Most social, biological, and technological networks display substantial non-trivial topological features, with patterns of connection between their elements that are neither purely regular nor purely random. Such features include a heavy tail in the degree distribution, a high clustering coefficient, assortativity or disassortativity among vertices, community structure, and hierarchical structure. In the case of directed networks these features also include reciprocity, triad significance profile and other features. In contrast, many of the mathematical models of networks that have been studied in the past, such as lattices and random graphs, do not show these features. The most complex structures)
    2017-11-21 20:08:22下载
    积分:1
  • Book
    Optical communication system book for Matlab
    2020-06-19 10:00:02下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载