-
ch37x芯片USB驱动（linux）
沁源ch37x的SPI转USB芯片在linux平台下的驱动
- 2022-01-25 18:56:29下载
- 积分：1
-
GA
说明： 利用遗传算法解决TSP问题,设置的是10个城市，每个城市坐标知道(Genetic algorithm to solve TSP problem, set the 10 cities, each city to know the coordinates)
- 2016-03-02 10:57:04下载
- 积分：1
-
最佳适应法
采用首次适应法、最佳适应法或最差适应法，编写一内存分配和回收模拟程序。 动态地随机产生新的“内存分配”或“内存回收”请求，再按照你选定的分配算法修改这个数组。由于这个实验的重点在于内存分配，所以不考虑与某内存区相关的进程情况。(used first to adapt, adapt best or the worst adaptation law, the preparation of a memory allocation and recovery simulation program. Dynamic random to create a new "memory allocation" or "memory recovery" request, then you have chosen in accordance with the allocation algorithm to change the array. As the focus of this experiment is memory allocation, it is not considered relevant to a certain memory area of the process.)
- 2004-09-07 01:37:09下载
- 积分：1
-
thermal-resistor
thermal resistor calculate
- 2015-03-13 23:59:17下载
- 积分：1
-
pwm
PWM project design 12 volt inverter circiut DIAGRAM
- 2013-12-24 19:15:18下载
- 积分：1
-
Partical-Swarm-Optimization
粒子群算法，能计算函数的最优值。希望对大家有用。。。。。。。。。。。。(Swarm optimization, hope to be useful. . . . . . . . . . . .)
- 2016-05-25 16:29:16下载
- 积分：1
-
OPNET_network_simulation
opnet网络仿真 清华出的，陈敏编辑，学习opnet的必读的书。主要是opnet Modeler Tutorials 翻译，对于看英语头疼的人来说，阅读非常容易~(OPNET_network_simulation)
- 2010-02-19 00:25:54下载
- 积分：1
-
USB-data-acquisition-card
基于USB接口的数据采集卡的设计，使用下位机采集数据通过USB传到上位机软件实时处理和显示波形。提供的资料： 1、优秀、完整毕业论文 2、可运行的上位机软件和上位机源代码 3、下位机硬件设计PCB原理图、制板图、所需的元件（下位机设计很简单， 但很有效） 4、下位机微处理器和数据采集程序 5、答辩PPT 6、中英文文献翻译 提供全部资料，毕业设计无需再做。这是本人大四的毕业设计题目，被评为优秀毕业论文，没有向外发表，并经过四次万方数据库查重，相似度只有3 ！本论文绝对惟一、有保障！ 附件提供了毕业论文主要设计以及上位机软件信息和采集结果。请有意者下载查阅，附件中提供了联系方式，如果论文符合您的要求，请继续和我联系，提供全部资料。(Based on USB interface data acquisition card design, the use of computer data acquisition by USB reached the PC software real-time processing and display waveform.)
- 2013-12-04 13:43:28下载
- 积分：1
-
OAK
OKA磨损模型的UDF，在fluent中采用编译型UDF加载(User defined function of OKA erosion model)
- 2021-04-22 16:58:48下载
- 积分：1
-
poj3941
poj 3941
Hideyuki is allowed by his father Ujisato some 1000 yen bills every month for his pocket money. In the first day of every month, the number of bills is decided as follows. Ujisato prepares n pieces of m-sided dice and declares the cutback k. Hideyuki rolls these dice. The number of bills given is the sum of the spots of the rolled dice decreased by the cutback. Fortunately to Hideyuki, Ujisato promises him to give at least one bill, even if the sum of the spots does not exceed the cutback. Each of the dice has spots of 1 through m inclusive on each side, and the probability of each side is the same.
In this problem, you are asked to write a program that finds the expected value of the number of given bills. (poj 3941 Hideyuki is allowed by his father Ujisato some 1000 yen bills every month for his pocket money. In the first day of every month, the number of bills is decided as follows. Ujisato prepares n pieces of m-sided dice and declares the cutback k. Hideyuki rolls these dice. The number of bills given is the sum of the spots of the rolled dice decreased by the cutback. Fortunately to Hideyuki, Ujisato promises him to give at least one bill, even if the sum of the spots does not exceed the cutback. Each of the dice has spots of 1 through m inclusive on each side, and the probability of each side is the same. In this problem, you are asked to write a program that finds the expected value of the number of given bills.)
- 2013-07-16 20:45:28下载
- 积分：1
