-
guiji
惯导系统轨迹生成器，能生成不同位置转动和舰船摇摆条件下的陀螺和加速度计数据，用于研究惯导系统(INS trajectory generator can generate different locations and ships swing conditions rotating gyroscope and accelerometer data, inertial navigation systems for research)
- 2013-08-29 09:49:03下载
- 积分：1
-
changevideomode
自己写的一个检测某个程序是否运行来改变系统分辨率的控制台程序(Writing own a Detect whether a program is running to change the system console resolution procedures)
- 2009-02-26 15:45:57下载
- 积分：1
-
aPLib-1.01
this is the library to compress and decompress any file. I found it on Net
- 2010-09-10 19:25:46下载
- 积分：1
-
CNC-chabu
实现两坐标运动控制，相当完美，看了这个代码，你也可以开发数控系统了(CNC CONTROL)
- 2021-02-14 10:39:49下载
- 积分：1
-
vgpicker
说明： 在mfc单文档下的p程序
通过碰撞检测实现了模型的抓捕(Mfc Single Document in p under the collision detection procedure realize the model to capture)
- 2008-09-25 15:54:50下载
- 积分：1
-
minroob
console application mineswiper
- 2013-03-04 06:01:55下载
- 积分：1
-
Camera_EXG50_GigE
Initialise and acquisition of Camera EXG50 GigE
- 2011-12-20 17:32:53下载
- 积分：1
-
medo
设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组，每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。 编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n（n<=200），表示每个数组有n个数。接下来的两行分别是X，Y数组的元素。结果输出 程序运行结束时，将计算出的中位数输出到文件output.txt中(Let X [0: n- 1] and Y [0: n- 1] for the two arrays, each array containing the n number has been sorted. 2n X and Y to identify the number of digits. programming tasks using the divide and conquer strategy try to design an O (log n) time algorithm to calculate this median number 2n. Data input by the input data provided input.txt file. The first line in the file has a positive integer n (n < = 200), that there are n numbers of each array. The next two lines are the X, Y array elements. The end result is output program runs, the calculated median output to file output.txt)
- 2021-03-22 16:29:16下载
- 积分：1
-
KTL
说明： 从专业设备上读取数据图像，并对其进行分析的代码。(from professional equipment to read data from images and analysis of its code.)
- 2005-09-17 11:17:51下载
- 积分：1
-
medo
设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组，每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。 编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n（n<=200），表示每个数组有n个数。接下来的两行分别是X，Y数组的元素。结果输出 程序运行结束时，将计算出的中位数输出到文件output.txt中(Let X [0: n- 1] and Y [0: n- 1] for the two arrays, each array containing the n number has been sorted. 2n X and Y to identify the number of digits. programming tasks using the divide and conquer strategy try to design an O (log n) time algorithm to calculate this median number 2n. Data input by the input data provided input.txt file. The first line in the file has a positive integer n (n < = 200), that there are n numbers of each array. The next two lines are the X, Y array elements. The end result is output program runs, the calculated median output to file output.txt)
- 2021-03-22 16:29:16下载
- 积分：1
