-
VCProgram
正方体投影，计算机图形学的综合实验内容，很全很专业的资源(eject)
- 2020-06-30 11:40:02下载
- 积分：1
-
twobarcode
二维码生成案例 VS2008 C#
可以选择 4种生成条形码的参数 目前不支持中间加图案
- 2012-12-21 15:04:56下载
- 积分：1
-
niudunfa
数值计算法，牛顿法求解非线性方程，适用于VC6.0(Numerical calculation method, Newton' s method for solving nonlinear equations for VC6.0)
- 2016-01-25 10:12:41下载
- 积分：1
-
JHGJGHJGFJG
题目：取一个整数a从右端开始的4～7位。
程序分析：可以这样考虑：
(1)先使a右移4位。
(2)设置一个低4位全为1,其余全为0的数。可用~(~0<<4)
(3)将上面二者进行&运算。
2.程序源代码：(Topic: take an integer a from the right end of the four to seven began.
Program analysis: it can be to consider:
(1) to make a move to the right four.
(2) sets a low four total for the 1, all the rest for 0 of the number. Can be used to (~ 0 < < 4)
(3) will above the difference and operations.
2. The source code:)
- 2012-05-26 20:20:03下载
- 积分：1
-
CAN-USB
CAN总线分析源代码
USB转CAN USBCAN 调试器 (CAN Bus Analyzer USB to CAN USBCAN source code debugger)
- 2013-07-09 22:51:28下载
- 积分：1
-
tingchechang
实现停车场模拟，用栈和队列实现，用系统时间自动记录进入和出去时间(Parking achieve simulation, with stacks and queues implemented by the system automatically records the time of entry and exit time)
- 2013-12-01 16:15:57下载
- 积分：1
-
querydef
使用ODBC实现的一个动态RecordSet(Using ODBC to implement an dynamic recordset)
- 2021-05-07 16:43:36下载
- 积分：1
-
FUP2算法---解决数据库更新后的关联规则挖掘
香港大学的David W.Cheung写的“A General Incremental Technique for Maintaining Discovered Association Rules”中提到的FUP2算法，用来解决数据库更新后的关联规则挖掘(University of Hong Kong, David W. Cheung wrote "A General Incremental Technique for Maintaining Discovered Association Rules" FUP2 mentioned in the algorithm used to solve the database updated Mining Association Rules)
- 2005-04-08 13:50:07下载
- 积分：1
-
kqglxt
说明： 用VB编程开发的 公司考勤管理系统，各个模块划分的很全面，是一个很适用的软件系统(Programming with VB company attendance management system, breakdown of each module is a comprehensive, is a very applicable software system)
- 2008-12-08 13:14:27下载
- 积分：1
-
钻石矿工
算法设计中的钻石矿工问题在一座金字塔每块石头上都镶有一块钻石从金字塔的顶端向下收集钻石尽可能收集价值高的钻石，每层每次只能从一块砖斜向左下或斜向右下走到另一块砖上。设计算法求出获取的钻石最大价值及路径。（动态规划）(The problem of diamond miner in algorithm design is set up on every stone in Pyramid. A diamond is collected from the top of Pyramid. Diamond is collected as high as possible. Every layer can only lean from one brick to the left or to the right to go to the next brick at a time. The design algorithm is used to find the maximum value and path of the obtained diamond. (dynamic programming))
- 2020-10-21 08:37:24下载
- 积分：1
