-
1
说明： 细分曲面catmullClark细分算法代码，直接运行的结果为一个实例的细分结果(subdivision surface)
- 2016-03-27 21:22:44下载
- 积分：1
-
pop
使用的硬件EM1206，POP通信。可以以pop的邮箱通信方式发送邮件(The hardware used the EM1206, POP communication. You can send a message to pop mailbox communication)
- 2013-01-04 14:22:45下载
- 积分：1
-
matlab
清华大学MATLAB综合实验 c语言要求较高 能很好的辅导作用(Tsinghua University the MATLAB integrated experimental c language require a higher good counseling role)
- 2013-03-27 09:30:21下载
- 积分：1
-
GUIhook95
修改Windows95 GUI函数的源代码 (The source for modifying windows 95s GUI function)
- 2001-01-06 00:00:00下载
- 积分：1
-
123
power control in WCDAM......
- 2010-02-02 22:11:53下载
- 积分：1
-
MyCTPTradingSystem
ctp交易程序 ctp交易程序 ctp交易程序 ctp交易程序(ctp trading system)
- 2014-10-13 22:19:08下载
- 积分：1
-
gsmc
基于一个二阶线性系统实例，介绍了全程滑模变结构控制，实现了系统的鲁棒性特点。(Global sliding mode variable structure control, based on a second order linear system instance, the robustness of the system characteristics.)
- 2013-03-05 09:37:16下载
- 积分：1
-
Recursive_integer_division
递归法求解整数划分。
整数划分，是指把一个正整数n写成如下形式：
n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。
如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )
- 2014-02-06 14:21:38下载
- 积分：1
-
pipe
某石油公司计划建造一条由东向西的主输油管道。该管道要穿过一个有n 口油井的油田。从每口油井都要有一条输油管道沿最短路经(或南或北)与主管道相连。如果给定n 口油井的位置,即它们的x 坐标（东西向）和y 坐标（南北向）,应如何确定主管道的最优位置, 即使各油井到主管道之间的输油管道长度总和最小的位置?证明可在线性时间内确定主管道的最优位置。(An oil company plans to construct a east to west from the main pipeline. The pipeline to pass through an oil field n wells. Wells from each must have a pipeline along the shortest path (or South or North) connected with the competent Road. If given the location of oil wells in n, that is, their x coordinates (east-west) and y coordinates (north-south), should be how to determine the optimal position in charge of Road, even if the wells to the pipeline in charge of Road between the sum of the smallest length location? proved to be linear time to determine the optimal position in charge of Road.)
- 2008-07-07 10:25:25下载
- 积分：1
-
MATLABmusic3
matlab演奏《最炫民族风》音乐的程序代码3(matlab music code3)
- 2012-08-11 15:52:14下载
- 积分：1
|
联系客服（QQ：3324461878）
