-
采用清华TPC
采用清华TPC-1十六位微机实验台上的并行口扫描键盘控制LED显示，以制作一个时间显示系统。-used Qinghua TPC-1 16 Microcomputer Laboratory platform parallel port scanning keyboard control LED display, for the production of a time display system.
- 2022-01-26 03:09:04下载
- 积分：1
-
Flex and JAVA configuration, the standard demand for documents, set up Eclipse p...
flex与java的配置，标准需求文档，设置eclipse提示功能。-Flex and JAVA configuration, the standard demand for documents, set up Eclipse prompts.
- 2022-03-13 14:42:19下载
- 积分：1
-
生产者-消费者问题 VC++实现
生产者-消费者问题 VC++实现 MFC界面控制实现
- 2022-11-27 20:25:03下载
- 积分：1
-
编辑框的子类化问题,限制在编辑框中只允许输入浮点数.
编辑框的子类化问题,限制在编辑框中只允许输入浮点数.-Edit box of the sub-class problem, limited to the edit box to allow only the importation of floating-point numbers.
- 2023-02-27 11:35:03下载
- 积分：1
-
ADO模块处理最常用的ADO功能.
ADO模块处理最常用的ADO功能.-ADO module handles the most commonly used functions ADO.
- 2022-06-12 21:31:16下载
- 积分：1
-
Josephus write a problem solving function. With the sequence of integers 1, 2, 3...
编写一个求解Josephus问题的函数。用整数序列1, 2, 3, ……, n表示顺序围坐在圆桌周围的人。然后使用n = 9, s = 1, m = 5，以及n = 9, s = 1, m = 0，或者n = 9, s = 1, m = 10作为输入数据，检查你的程序的正 确性和健壮性。最后分析所完成算法的时间复杂度。定义JosephusCircle类，其中含完成初始化、报数出圈成 员函数、输出显示等方法。-Josephus write a problem solving function. With the sequence of integers 1, 2, 3, ... ..., n the order of sitting around the round table, said the people around. And then use n = 9, s = 1, m = 5, and n = 9, s = 1, m = 0, or n = 9, s = 1, m = 10 as input data, check the correctness of your program and robustness. Completed the final analysis, the algorithm" s time complexity. Definition JosephusCircle class, which included the completion of initialization, reported that the number of member functions of a circle, the output display and other methods.
- 2022-04-13 07:18:12下载
- 积分：1
-
OPC客户端接口
opc client interface
- 2022-08-18 23:49:49下载
- 积分：1
-
Delaunay三角网作为一种主要的DTM表尔法，具有权其广泛的用途。经过二十多年来的研究，它的生成算法巳趋于成熟。本文简要介绍了Delaunay三角网的定又及...
Delaunay三角网作为一种主要的DTM表尔法，具有权其广泛的用途。经过二十多年来的研究，它的生成算法巳趋于成熟。本文简要介绍了Delaunay三角网的定又及其特性，在简单回顾和评价了分割―归并法，逐点插入法，三角冈生长法等三类主沈算法的基础上，提出了一个融以上算法优点于一体，兼顾空间与时间性能的合成算法。经测试，一般情况下它的运算速度远快于逐点插入法，与分割―归并法相当，较好的情况下快于分割―归并法。-Delaunay Triangulation as a major DTM Fall table, with the right to its extensive use. After 20 years of study, which had been generating algorithm is maturing. This paper introduces a Delaunay Triangulation and another set of characteristics, in a brief review and evaluation of the divide-conquer method, point by point insertion method, the supraspinatus Growth Triangle law Shen three main algorithm on the basis of the above algorithm into an advantage in that balanced space and time performance of synthesis algorithm. After tests, under normal circumstances it"s computational speed much faster than the insertion point by point, and the divide-conquer method rather, a better situation faster than divide-conquer method.
- 2022-08-21 12:05:01下载
- 积分：1
-
The closure of a window, suitable for beginners
关闭某个窗口，适合初学者研究和学习，本代码是一个完整的程序。-The closure of a window, suitable for beginners
- 2022-06-16 13:45:52下载
- 积分：1
-
包含图的深度优先探索遍历和广度优先探索遍历，能从图中的任一顶点出发访问图中所有顶点...
包含图的深度优先探索遍历和广度优先探索遍历，能从图中的任一顶点出发访问图中所有顶点-Includes plans to explore the depth-first traversal and breadth-first traversal to explore, from the graph the starting point of any visit to Figure 1 for all vertices
- 2022-03-03 04:02:20下载
- 积分：1
