-
SharpCap源码,并附有相关的例子，可实现抓包
SharpCap源码,并附有相关的例子，可实现抓包-SharpCap source code, along with relevant examples, can be realized Ethereal
- 2022-03-24 12:22:43下载
- 积分：1
-
vm_unpack
利用sdk调用虚拟机进行脱壳的例子程序，大家可以看看，内有详细的说明文档，供大家参阅。(Sdk call virtual machine shelling the example program, we can see, with detailed documentation, for all to see.)
- 2013-02-22 20:50:36下载
- 积分：1
-
cdq.rar
基于时间序列法的超短期电力负荷预测 利用时间序列法进行数学建模(Mathematical modeling based on very short-term power load time series forecasting using time series method)
- 2021-04-29 11:08:43下载
- 积分：1
-
SerialPort_vc
一个关于串口通信编程的小程序，使用visual c++编写。(Serial communication programming on small procedures, the use of visual c++ Prepared.)
- 2007-07-16 15:57:05下载
- 积分：1
-
C# by using prepared software midi piano player for the people enjoy reading C#
C#通过使用事先准备好的midi钢琴演奏软件，让人们喜欢阅读C#
- 2022-04-10 03:44:46下载
- 积分：1
-
STM32F10xUSBLib2.21-虚拟串口
stm32做的虚拟接口模拟USB，有需要的可以下载(STM32 virtual interface to simulate USB, there is a need to download.)
- 2018-09-14 13:43:30下载
- 积分：1
-
achieve code statements can be combined to achieve a variety of interfaces, the...
报表实现代码,可以实现多种界面组合情况,使用C#编写,支持IE浏览-achieve code statements can be combined to achieve a variety of interfaces, the use of C# prepared to support Internet Explorer
- 2022-07-28 07:56:44下载
- 积分：1
-
fy325
包括广义互相关函数GCC时延估计，欢迎大家下载学习，有借鉴意义哦。( Including the generalized cross-correlation function GCC time delay estimation, Welcome to download the study, There are reference Oh.)
- 2017-05-25 17:19:45下载
- 积分：1
-
sdk
һ
- 2008-09-24 21:50:49下载
- 积分：1
-
Recursive_integer_division
递归法求解整数划分。
整数划分，是指把一个正整数n写成如下形式：
n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。
如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )
- 2014-02-06 14:21:38下载
- 积分：1
