虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

n-to-<b>default</b>

  • This I develops based on the B/S structure student managementsystem management system, hoped brings

    This I develops based on the B/S structure student managementsystem management system, hoped brings a help to the novice

    标签: managementsystem management structure develops

    上传时间: 2014-01-07

    上传用户:钓鳌牧马

  • acm HDOJ 1051WoodenSticks Description: There is a pile of n wooden sticks. The length and weight o

    acm HDOJ 1051WoodenSticks Description: There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to prepare processing a stick. The setup times are associated with cleaning operations and changing tools and shapes in the machine. The setup times of the woodworking machine are given as follows: (a) The setup time for the first wooden stick is 1 minute. (b) Right after processing a stick of length l and weight w , the machine will need no setup time for a stick of length l and weight w if l<=l and w<=w . Otherwise, it will need 1 minute for setup.

    标签: WoodenSticks Description length wooden

    上传时间: 2014-03-08

    上传用户:netwolf

  • Verilog HDL: Magnitude For a vector (a,b), the magnitude representation is the following: A c

    Verilog HDL: Magnitude For a vector (a,b), the magnitude representation is the following: A common approach to implementing these arithmetic functions is to use the Coordinate Rotation Digital Computer (CORDIC) algorithm. The CORDIC algorithm calculates the trigonometric functions of sine, cosine, magnitude, and phase using an iterative process. It is made up of a series of micro-rotations of the vector by a set of predetermined constants, which are powers of two. Using binary arithmetic, this algorithm essentially replaces multipliers with shift and add operations. In a Stratix™ device, it is possible to calculate some of these arithmetic functions directly, without having to implement the CORDIC algorithm.

    标签: representation Magnitude the magnitude

    上传时间: 2013-12-24

    上传用户:金宜

  • 设B是一个n×n棋盘

    设B是一个n×n棋盘,n=2k,(k=1,2,3,…)。用分治法设计一个算法,使得:用若干个L型条块可以覆盖住B的除一个特殊方格外的所有方格。其中,一个L型条块可以覆盖3个方格。且任意两个L型条块不能重叠覆盖棋盘

    标签:

    上传时间: 2013-12-16

    上传用户:脚趾头

  • design LP,HP,B S digital Butterworth and Chebyshev filter. All array has been specified internally

    design LP,HP,B S digital Butterworth and Chebyshev filter. All array has been specified internally,so user only need to input f1,f2,f3,f4,fs(in hz), alpha1,alpha2(in db) and iband (to specify the type of to design). This program output hk(z)=bk(z)/ak(z),k=1,2,..., ksection and the freq.

    标签: Butterworth internally Chebyshev specified

    上传时间: 2015-11-08

    上传用户:253189838

  • About: hamsterdb is a database engine written in ANSI C. It supports a B+Tree index structure, uses

    About: hamsterdb is a database engine written in ANSI C. It supports a B+Tree index structure, uses memory mapped I/O (if available), supports cursors, and can create in-memory databases. Release focus: Major feature enhancements Changes: This release comes with many changes and new features. It can manage multiple databases in one file. A new flag (HAM_LOCK_EXCLUSIVE) places an exclusive lock on the file. hamsterdb was ported to Windows CE, and the Solution file for Visual Studio 2005 now supports builds for x64. Several minor bugs were fixed, performance was improved, and small API changes occurred. Pre-built libraries for Windows (32-bit and 64-bit) are available for download. Author: cruppstahl

    标签: C. hamsterdb structure database

    上传时间: 2013-12-11

    上传用户:LouieWu

  • 编写一个用SOR法解方程组Ax=b的计算机程序

    编写一个用SOR法解方程组Ax=b的计算机程序,其中 要求程序中不存系数A,分别对不同的阶数(例如n=15,80)取w=1.7,1.8,1.9,进行迭代,记录近似解 达到 时所用迭代次数k,观察松弛因子对收敛速度的影响。

    标签: SOR Ax 编写 方程

    上传时间: 2013-12-25

    上传用户:wcl168881111111

  • A* sudo sudo/* B* adduser script adduser C* rmuser script rmuser E* tout tout/*

    A* sudo sudo/* B* adduser script adduser C* rmuser script rmuser E* tout tout/* F* dumdum dumdum G* lostfile lostfile H* Mkfl.localsys Makefile.localsys I* spacegripe spacegripe J* sendmail.cf sendmail.cf N* remote remote.c O* distributed conrol distrib/* P* hosts and name server makerevhosts Q* xargs xargs/*

    标签: adduser script rmuser sudo

    上传时间: 2016-03-29

    上传用户:gxrui1991

  • 对PL0原编译器进行了以下的扩充:1.增加以下保留字else(elsesym), for(forsym),to(tosym),downto(downtosym),return(returnsym),[

    对PL0原编译器进行了以下的扩充:1.增加以下保留字else(elsesym), for(forsym),to(tosym),downto(downtosym),return(returnsym),[(lmparen),](rmparen) 2.增加了以下的运算符:+=(eplus),-=(eminus),++(dplus),--(dminus) 取址运算符&(radsym),指向运算符@(padsym) 3.修改单词:修改不等号#为<> 4.扩充语句:(1)增加了else子句 (2)增加了for语句 5.增加运算:(1).++运算 (2).--运算;(3).+=运算 (4).-=运算;(5).&取址运算; (6).@指向运算; 6.增加类型:(1).增加多维数组a[i1][i2][i3]……[i(n-1)][i(n-2)][in] (2).增加指针类型(任何变量都能存放指针,但不支持指针的指针,如b:=@@a应该改写为c:=@a,b:=@c) 7.将过程procedure扩展为函数:(1).允许定义过程时在其后加参数(var a, var b,……..,var n) (2)允许通过指针向函数形式参数传地址;(3)允许返回值;可以用 a:=p(a,b,c….,n) 返回

    标签: downtosym returnsym elsesym downto

    上传时间: 2016-07-02

    上传用户:saharawalker

  • 5.22④ 假设系数矩阵A和B均以三元组表作为存储结构。 试写出满足以下条件的矩阵相加的算法:假设三元组表A 的空间足够大

    5.22④ 假设系数矩阵A和B均以三元组表作为存储结构。 试写出满足以下条件的矩阵相加的算法:假设三元组表A 的空间足够大,将矩阵B加到矩阵A上,不增加A、B之外 的附加空间,你的算法能否达到O(m+n)的时间复杂度?其 中m和n分别为A、B矩阵中非零元的数目。

    标签: 5.22 矩阵 三元 系数

    上传时间: 2013-12-13

    上传用户:coeus