-
MCP3204
51单片机读取16位AD芯片MCP3204程序,可读取4路通道,程序中写了两路,可根据注释增加或减少通道数,1602显示,有Proteus仿真。(51 MCU reads 16-bit AD chip MCP3204 program, which can read 4 channels and write two channels. According to the annotation, the number of channels can be increased or reduced. 1602 shows that there is Proteus simulation.)
- 2019-06-28 13:13:11下载
- 积分:1
-
The data reported have written a program, you can choose your own data files, pr...
一个自己编写的数据报程序,可以选择自己的数据文件,打印报表,多多指教-The data reported have written a program, you can choose your own data files, printing reports, the exhibitions
- 2023-01-23 04:55:04下载
- 积分:1
-
说明:下载后只需要将后缀名.rar改为.exe即可执行
一个很方便GPRS模块连接PC上网的拨号程序,在执行该程序前,需要用PC的超级终端下三个A...
说明:下载后只需要将后缀名.rar改为.exe即可执行
一个很方便GPRS模块连接PC上网的拨号程序,在执行该程序前,需要用PC的超级终端下三个AT命令:1、AT+CGATT=1 2、AT+CGDCONT=1,ip,cmnet 3、AT+CGACT=1
之后直接输入号码,点“Connect"后,就可用IE上网
自己用两个不同的GPRS模块加SIM卡在PC上测试过,没有错误。-说????下载 ?笾 恍枰 ?将 ????名.rar ?奈 ? Exe ?
- 2022-02-02 00:52:48下载
- 积分:1
-
协议树实现方式
协议树实现流程(tree)
- 2018-02-01 15:08:27下载
- 积分:1
-
SNAKE
说明: 自己编写的游蛇游戏,代码很简单,希望对编程初学者有帮助。(I have written snake game, the code is very simple, I hope to help beginners in programming.)
- 2011-02-24 17:44:27下载
- 积分:1
-
calculation of gear mesh stiffness
用于斜齿齿轮啮合时变刚度求解,基于matlab编写源程序。(calculation of gear mesh stiffness)
- 2020-07-03 12:00:02下载
- 积分:1
-
基于P87LPC760的DALI从机
基于P87LPC760的DALI从机-P87LPC760 based machine from the DALI
- 2022-07-22 06:24:42下载
- 积分:1
-
USACO Section 2.1的全部AC的代码
OIer专用.
USACO Section 2.1的全部AC的代码
OIer专用.-USACO Section 2.1 all OIer dedicated AC code.
- 2022-08-24 22:07:37下载
- 积分:1
-
遗传算法求解多旅行商问题
旅行商问题(TravelingSalesmanProblem,TSP)是一个经典的组合优化问题。经典的TSP可以描述为:一个商品推销员要去若干个城市推销商品,该推销员从一个城市出发,需要经过所有城市后,回到出发地。应如何选择行进路线,以使总的行程最短。从图论的角度来看,该问题实质是在一个带权完全无向图中,找一个权值最小的Hamilton回路。由于该问题的可行解是所有顶点的全排列,随着顶点数的增加,会产生组合爆炸,它是一个NP完全问题。(Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem. The classic TSP can be described as: a merchandiser sells goods to several cities. The salesman starts from a city and needs to go through all the cities and return to the starting point. How to choose the route of travel so that the total journey is the shortest. From the point of view of graph theory, the essence of the problem is to find a Hamilton loop with the smallest weight in a completely undirected graph with weights. Since the feasible solution to this problem is the full permutation of all vertices, as the number of vertices increases, a combinatorial explosion occurs, which is an NP-complete problem.)
- 2020-06-17 11:00:02下载
- 积分:1
-
ieee802.11关于ad hoc网路协议的介绍,希望对各位学习有所帮助。...
ieee802.11关于ad hoc网路协议的介绍,希望对各位学习有所帮助。-IEEE802.11 on the ad hoc network protocols, the wish to help you learn.
- 2022-05-16 04:14:43下载
- 积分:1