-
SIM800C 原理图
SIM800C 原理图,带电源处理和SIM卡槽，兼容两种天线座子(SIM800C schematic with power handling and SIM card slot, compatible with two antenna holders)
- 2020-06-16 13:40:01下载
- 积分：1
-
OA
说明： 开源免费OA系统，附带数据库创建脚本，比较好安装(Open Source Free OA system, with database creation scripts, is better to install)
- 2010-03-30 16:17:52下载
- 积分：1
-
DAC0832
DAC0832的应用，DAC0832的应用(DAC0832' s application, DAC0832 application)
- 2012-06-25 22:43:27下载
- 积分：1
-
FlatLeapYearRecognition
基于VC6.0平台编写的一个图形化界面平闰年识别器，界面精美，值得VC初学者参考！(Flat leap year recognition)
- 2013-08-04 15:17:33下载
- 积分：1
-
xinhao
此程序适合对数字基带信号的仿真，并对两径信道传递函数曲线分析(This program suitable for digital base-band signal simulation, and the two-path channel transfer function curve analysis)
- 2009-03-13 23:11:04下载
- 积分：1
-
QRDCMP
用镜像矩阵求出矩阵的QR分解（正交三角分解），并求解线性方程组，该方法不必选主元，但其计算过程非常稳定。也可用于求矩阵的广义逆和求解线性最小二乘问题。子过程QRDCMP用镜像矩阵求m*n矩阵A的QR分解，A=Q^TR,其中Q是m*m正交矩阵，R为m*n上三角矩阵；子过程QRBKSB用矩阵的QR分解求解线性方程组Ax=b，其中A为n阶非奇异方阵。(Matrix obtained with the mirror matrix QR decomposition (orthogonal triangular decomposition), and solving linear equations, the method does not have to choose the main element, but its calculation process is very stable. Can also be used to find the generalized inverse matrix and solving linear least squares problems. Sub-process of the mirror matrix QRDCMP m* n matrix A QR decomposition, A = Q ^ TR, wherein Q is a m* m orthogonal matrix, R is m* n upper triangular matrix subprocess QRBKSB a QR decomposition to solve the matrix linear equations Ax = b, where A is non-singular square matrix of order n.)
- 2013-09-27 11:05:18下载
- 积分：1
-
VC6ADOACCESS
说明： VC++使用ADO开发ACCESS数据库,可以进行增删,改,查询等对数据库的管理(VC++ using ADO database development ACCESS, additions and deletions can be changed, the database query, such as the management of)
- 2009-08-22 09:47:56下载
- 积分：1
-
4-10
这是清华版c＋＋程序设计 第四章课后题第10题(This is the Tsinghua version c Program Design Chapter IV title after title No. 10)
- 2008-01-05 13:47:01下载
- 积分：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
-
EBOOK
网上书店asp.net源码,实现购物车功能，买卖，账单等(source code of asp.net book shop)
- 2010-03-08 10:52:01下载
- 积分：1
