-
TCPhit
WINDOW的打孔程序源代码，还有作者的说明，不错，想做病毒、外挂的学学，教你怎么样穿透防火墙(WINDOW perforated the source code, as well as the author s note, yes, we want to do viruses, plug-in to learn, teach you how to penetrate the firewall)
- 2007-11-29 16:27:01下载
- 积分：1
-
MLX90614
说明： 适用于stm32平台，已经过实际测试，测试模块为GY-906(It is applicable to STM32 platform and has been tested in practice)
- 2020-05-07 17:40:02下载
- 积分：1
-
PIDMatlabC
介绍了PID算法的matlab编程以及相对应的C语言编程(Introduced PID algorithm matlab programming and the corresponding C language programming)
- 2013-08-08 22:49:13下载
- 积分：1
-
偏最小二乘PLS的matlab代码实现
偏最小二乘PLS的matlab代码实现,可用于(The program computes the composition of benzene, toluene and p-xylene versus time in all column plates. The steady state values are plotted versus the plate number for all three components. This MATLAB program is adapted from an example given in Chemical Engineering Dynamics by Ingham et al., Wiley-VCH, 2000)
- 2022-05-15 11:59:36下载
- 积分：1
-
AuxParticleFilter
Auxiliary Particle Filter implemented in C# (also known as condensation algorithm, Sequential Monte Carlo, etc..)
See Auxiliary Particle Filter by Pitt/Shephard 1998 for details on this algorithm. Will need to be modified for your use but should give a good start!
- 2009-07-24 08:03:03下载
- 积分：1
-
Flashing-an-LED
不同頻率閃爍一個LED燈 用sbit 關鍵字 定義 LED到P0.0端口，LED是自己任意定義且容易記憶的符號(Flashing an LED light at different frequencies)
- 2011-11-03 10:42:47下载
- 积分：1
-
226785numericalhomework
说明： 北航数值分析课件全套，包含考试题和大作业的要求。(Beihang numerical analysis courseware)
- 2019-11-20 18:42:10下载
- 积分：1
-
xiyuxiuxianguanlixitong
说明： 一个洗浴休闲管理系统代码，MFC开发的，用SQL server数据库(A management system)
- 2009-08-23 14:14:54下载
- 积分：1
-
management-system
学生成绩管理系统，具体包括所在班级的学生信息管理、课程信息管理以及学生成绩管理，并完成相应的查询、统计、排序输出等功能。(Student achievement management system, including the student s specific class information management, information management courses and student achievement management, and complete the appropriate query, statistics, sorting out other functions.)
- 2013-12-28 10:32:42下载
- 积分：1
-
knapsack-problem-UC
0-1背包问题解决机组组合问题（给定N中物品和一个背包。物品i的重量是Wi,其价值位Vi ，背包的容量为C。问应该如何选择装入背包的物品，使得转入背包的物品的总价值为最大？？
在选择物品的时候，对每种物品i只有两种选择，即装入背包或不装入背包。不能讲物品i装入多次，也不能只装入物品的一部分。因此，该问题被称为0-1背包问题。
）(0-1 knapsack problem solving unit commitment problem (in a given N items and a backpack. Weight of the items i is Wi, the value of bit Vi, knapsack capacity C. Ask how to choose the items into the backpack, making the turn The total value of goods for the biggest backpack?? when selecting items for each item i have only two choices, that is loaded or not loaded backpack backpack. items i can not speak loading times, can not just load part of the article, so the problem is called 0-1 knapsack problem.))
- 2014-05-16 10:56:47下载
- 积分：1
