-
usb_232
这是一个硬件的开发实例，是USB到串口的轮换实例。(This is an example of the development of hardware, USB to Serial examples of the rotation.)
- 2005-04-21 10:41:33下载
- 积分：1
-
Noise-on-Duffing-equation-based-on-the-impact-of-w
噪声对基于Duffing方程弱信号检测的影响研究Noise on Duffing equation based on the impact of weak signal detection(Noise on Duffing equation based on the impact of weak signal detection)
- 2011-01-09 16:52:06下载
- 积分：1
-
ben_ke_jiao_wu_xi_tong
纯C++代码，在大部分编译环境下编译通过。支持不同级别用户具有不同修改查看权限。支持鼠标点击，具有炫丽的鼠标悬停效果(Pure C++ code, in most compiler environment compile. Support for different levels of users with different permissions to modify the view. Support mouse clicks, mouse-over effects with dazzling)
- 2013-10-18 10:05:47下载
- 积分：1
-
linq操作数据以及集合实例
linq操作数据以及集合实例
- 2013-01-25下载
- 积分：1
-
Delaunay
三维重建中散乱点云数据的常用网格生成算法delaunay三角网格生成算法(delaunay triangular mesh generation algorithm)
- 2016-11-08 18:24:50下载
- 积分：1
-
C++编的迷宫程序
由C++编写的程序，自己设置迷宫，程序开始寻找出口，并画出路线，程序简单，希望给初学者以启发
- 2023-07-04 05:35:04下载
- 积分：1
-
8queen
在一个8×8国际象棋盘上，有8个皇后，每个皇后占一格；要求皇后间不会出现相互"攻击"的现象,即不能有两个皇后处在同一行、同一列或同一对角线上。问共有多少种不同的方法。
本算法采用一维数组来进行处理。数组的下标i表示棋盘上的第i列，a[i]的值表示皇后在第i列所放的位置。如：a[1]=5，表示在棋盘的第一例的第五行放一个皇后。(8 × 8 in a chess set, there s eight, each accounting for a Queen s grid request will not be any mutual between Queen s attack phenomenon, that can not have two Queen s in the same line, the same row or the same diagonal. Asked the total number of different ways. This algorithm uses one-dimensional array to be processed. Array subscript i said i chessboard first out, a [i] value that s in the first place i listed by location. Such as: a [1] = 5, said the first cases in the chessboard of the fifth line of a Queen s release.)
- 2007-12-15 22:24:44下载
- 积分：1
-
interlock
计算机联锁源代码，精品！对初学者很有用的，绝对值得一看！(Computer Interlocking source code, boutique! Very useful for beginners, and definitely worth a look!)
- 2020-07-11 21:48:54下载
- 积分：1
-
ISO_8583_s1935889272005
ISO 8583 implementation.
- 2008-06-03 15:05:55下载
- 积分：1
-
基于QT实现的基础图形绘图系统.7z
输入椭圆中心和长短轴径;
2. 计算得到中心在原点的椭圆上的第一个点=;
3. 根据公式(1.1.3-2)计算区域1中决策参数的初值为;
4. 在区域1中每个位置处，从开始，反复按照公式(1.1.3-3)更新决策参数，若决策参数小于0则不变，反之加1，一直循环到为止，记第一个满足此条件的点为();
5. 在区域2的每个位置处，从开始，反复按照公式(1.1.3-6)更新决策参数，若决策参数小于0则不变，反之加1，一直循环到()为止;(Input ellipse center and long and short axis diameter;
2. The first point of the center on the ellipse at the origin is calculated.
3. According to formula (1.1.3-2), the initial value of decision-making parameters in region 1 is calculated.
4. At each location in region 1, the decision-making parameters are updated repeatedly according to formula (1.1.3-3). If the decision-making parameters are less than 0, they will remain unchanged. If the decision-making parameters are less than 0, then add 1 and cycle until the first point satisfying this condition is ();
5. At each location of region 2, the decision parameters are updated repeatedly according to the formula (1.1.3-6). If the decision parameters are less than 0, they will remain unchanged. If the decision parameters are less than 0, then add 1 and cycle until ().)
- 2020-11-13 16:49:42下载
- 积分：1
