-
TS流同步模块，对于输入的TS流信号提取同步头。
TS流同步模块，对于输入的TS流信号提取同步头。-TS Stream Synchronization Module
- 2022-11-29 04:30:04下载
- 积分：1
-
用E语言编写的一个简单游戏，第一次做做的不是很好，请多多指教...
用E语言编写的一个简单游戏，第一次做做的不是很好，请多多指教-With E written in a simple game, for the first time doing the not very good, please the exhibitions
- 2022-02-01 18:35:11下载
- 积分：1
-
在s3c2410 linux2.4.x 中的以太网接套字开发例子，测试OK
在s3c2410 linux2.4.x 中的以太网接套字开发例子，测试OK-S3c2410 linux2.4.x in the Ethernet access examples of sets of characters to develop, test OK
- 2022-08-17 12:58:40下载
- 积分：1
-
C in A Nutshell
Learning a language
C in A Nutshell
Learning a language--any language--involves a process wherein you learn to rely less and less on instruction and more increasingly on the aspects of the language you ve mastered. Whether you re learning French, Java, or C, at some point you ll set aside the tutorial and attempt to converse on your own. It s not necessary to know every subtle facet of French in order to speak it well, especially if there s a good dictionary available. Likewise, C programmers don t need to memorize every detail of C in order to write good programs. What they need instead is a reliable, comprehensive reference that they can keep nearby. C in a Nutshell is that reference.
- 2022-12-16 09:20:03下载
- 积分：1
-
很简单的牛顿算法,不考虑其他的东西，只用简单的迭代
很简单的牛顿算法,不考虑其他的东西，只用简单的迭代-new ton
- 2023-03-10 08:35:03下载
- 积分：1
-
7 segment driving with 74164 with atmel
7 segment driving with 74164 with atmel
- 2022-05-04 22:44:22下载
- 积分：1
-
Intel programming contest entries source code, room allocation
Intel 编程大赛参赛源代码，房间分配问题-Intel programming contest entries source code, room allocation
- 2022-08-12 08:42:14下载
- 积分：1
-
一个小学生常玩的游戏，算24点，VB实现
本程序已经作出了个很好的游戏界面。...
一个小学生常玩的游戏，算24点，VB实现
本程序已经作出了个很好的游戏界面。-one of the students often play games, counting 24 points, VB of the procedures have already made a very good game interface.
- 2022-01-25 22:20:50下载
- 积分：1
-
Adaptive control of induction motor model
Adaptive control of induction motor model
- 2022-03-25 10:32:09下载
- 积分：1
-
本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小...
本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.
- 2022-01-25 16:01:13下载
- 积分：1
