％调用格式 =trapez_g( f_name ,a,b,n) ％f_name: 被积函数的文件名f(x) ％ a:x的上限 ％ b:x的下限 ％ 部分区间数 ％实例：trapez_g( sin ,0,pi,20)
上传时间： 2013-12-19
上传用户：cjl42111
Program main BIOS image | | /B - Program Boot Block | | /N - Program NVRAM | | /C - Destroy CMOS checksum | | /E - Program Embedded Controller Block | | /K - Program all non-critical blocks | | /Kn - Program n th non-critical block only(n=0-7) | | /Q - Silent execution | | /REBOOT - Reboot after programming | | /X - Don t Check ROM ID | | /S - Display current system s ROMID | | /Ln - Load CMOS defaults
标签： Program Destroy Block NVRAM
上传时间： 2016-07-26
上传用户：wfl_yy
采用3D Bresenham算法在两点间划一直线 ％ This program is ported to MATLAB from: ％ B.Pendleton. line3d - 3D Bresenham s (a 3D line drawing algorithm) ％ ftp://ftp.isc.org/pub/usenet/comp.sources.unix/volume26/line3d, 1992 ％ ％ Which is referenced by: ％ Fischer, J., A. del Rio (2004). A Fast Method for Applying Rigid ％ Transformations to Volume Data, WSCG2004 Conference. ％ http://wscg.zcu.cz/wscg2004/Papers_2004_Short/M19.pdf
标签： Bresenham Pendleton program MATLAB
上传时间： 2013-12-10
上传用户：sz_hjbf
计算机网络-系统方法 第三版 英文版 作 者： （美）彼德森（Peterson,L.L.） 等著 出 版 社： 机械工业出版社 出版时间： 2005-3-1 字 数： 版 次： 1 页 数： 813 印刷时间： 2005/03/01 开 本： 印 次： 纸 张： 胶版纸 I S B N ： 9787111160564 包 装： 平装 所属分类： 图书 >> 计算机/网络 >> 计算机理论
上传时间： 2013-12-27
上传用户：weiwolkt
The "GEE! It s Simple" package illustrates Gaussian elimination with partial pivoting, which produces a factorization of P*A into the product L*U where P is a permutation matrix, and L and U are lower and upper triangular, respectively. The functions in this package are accurate, but they are far slower than their MATLAB equivalents (x=A\b, [L,U,p]=lu(A), and so on). They are presented here merely to illustrate and educate. "Real" production code should use backslash and lu, not this package.
标签： illustrates elimination Gaussian pivoting
上传时间： 2016-11-09
上传用户：wang5829
The "GEE! It s Simple" package illustrates Gaussian elimination with partial pivoting, which produces a factorization of P*A into the product L*U where P is a permutation matrix, and L and U are lower and upper triangular, respectively. The functions in this package are accurate, but they are far slower than their MATLAB equivalents (x=A\b, [L,U,p]=lu(A), and so on). They are presented here merely to illustrate and educate. "Real" production code should use backslash and lu, not this package.
标签： illustrates elimination Gaussian pivoting
上传时间： 2014-01-21
上传用户：lxm
Problem B:Longest Ordered Subsequence A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8).
标签： Subsequence sequence Problem Longest
上传时间： 2016-12-08
上传用户：busterman
Data Structures and Algorithms with Object-Oriented Design Patterns in Java Bruno R. Preiss B.A.Sc., M.A.Sc., Ph.D., P.Eng. Associate Professor Department of Electrical and Computer Engineering University of Waterloo, Waterloo, Canada
标签： B.A.S R. Object-Oriented Algorithms
上传时间： 2017-03-07
上传用户：z754970244
设B是一个n×n棋盘，n=2k,(k=1,2,3,…)。用分治法设计一个算法，使得：用若干个L型条块可以覆盖住B的除一个特殊方格外的所有方格。其中，一个L型条块可以覆盖3个方格。且任意两个L型条块不能重叠覆盖棋盘。
标签：
上传时间： 2013-12-19
上传用户：xc216
21世纪大学新型参考教材系列 集成电路B 荒井
上传时间： 2013-04-15
上传用户：eeworm
