O Reilly最新IT類書籍(1218) OReilly.Unix.in.a.Nutshell.4th.Edition OReilly.Mac.OS.X.Tiger.in.a.Nutshell OReilly.Monad OReilly.UML.2.0.in.a.Nutshell OReilly.Oracle.PL.SQL.for.DBAs OReilly.Open.Sources.2.0 OReilly.Applied.Software.Project.Management
标签： Nutshell OReilly Edition Reilly
上传时间： 2013-12-21
上传用户：dancnc
很牛B的Mpi并行算法 很牛B的Mpi并行算法 很牛B的Mpi并行算法 很牛B的Mpi并行算法
上传时间： 2013-11-27
上传用户：wcl168881111111
MC9328MX1 自举模式下的b-record 格式代码
上传时间： 2014-01-04
上传用户：hjshhyy
用递规子程序的方法实现HANOI塔问题.子程序模块个数不限. 要求: 盘子个数可以输入,第一个塔为A,第二个塔为B,第三个塔 的名称为C.打印出移动过程.
上传时间： 2013-12-17
上传用户：Yukiseop
企业物资管理系统 为了使物资管理部门的责、权、利得到落实, 以提高总体的经济效益,采用J2EE 技术体系, 设计与实现了B/S 模式下的企业物资管理系统, 依据开发实例,分析了企业物资管理系统的业务需求和设计目标, 详细讨论了系统的实现技术、实现方案及安全设计
上传时间： 2015-10-22
上传用户：liglechongchong
In 1960, R.E. Kalman published his famous paper describing a recursive solution to the discrete-data linear filtering problem. Since that time, due in large part to advances in digital computing, the Kalman filter has been the subject of extensive research and application, particularly in the area of autonomous or assisted navigation.
标签： R.E. discrete-dat describing published
上传时间： 2015-10-22
上传用户：2404
In 1960, R.E. Kalman published his famous paper describing a recursive solution to the discretedata linear filtering problem [Kalman60]. Since that time, due in large part to advances in digital computing, the Kalman filter has been the subject of extensive research and application, particularly in the area of autonomous or assisted navigation. A very “friendly” introduction to the general idea of the Kalman filter can be found in Chapter 1 of [Maybeck79], while a more complete introductory discussion can be found in [Sorenson70], which also contains some interesting historical narrative.
标签： R.E. discretedata describing published
上传时间： 2015-10-22
上传用户：a673761058
in this paper,wo propose an extension of the zerotree-based space-frequency quantization algorithm by adding a wedgelet symbol to its tree-pruning optimization.
标签： space-frequency zerotree-based quantization algorithm
上传时间： 2015-10-22
上传用户：yxgi5
一个旅行家想驾驶汽车从城市A到城市B（设出发时油箱是空的）。给定两个城市之间的距离dis、汽车油箱的容量c、每升汽油能行驶的距离d、沿途油站数n、油站i离出发点的距离d[i]以及该站每升汽油的价格p[i],i=1,2,…,n。设d[1]=0<d[2]<…<d[n]。要花最少的油费从城市A到城市B，在每个加油站应加多少油，最少花费为多少？
上传时间： 2013-12-31
上传用户：redmoons
b样条曲线，有控制点的求法，还有用OPENGL显示算法
标签：
上传时间： 2014-01-27
上传用户：evil
