Computation. The Basic Annual Rent for each Lease Year after the first Lease Year is computed by multiplying the Basic Annual Rent for the first Lease Year by a fraction which has as its numerator the CPI for the Adjustment Month and as its denominator the CPI for the Base Month. The amount of each Monthly Installment of Basic Annual Rent in each Lease Year after the first Lease Year shall be computed by dividing the Basic Annual Rent for such Lease Year by twelve.(2)
Computation has the meaning set forth in Section 6.01(e)(ii).
Computation shall have the meaning defined in art. 2.2.2 of this Agreement.
Examples of Computation in a sentence
Computation of Change in Contract Amount: As specified in the Agreement and Conditions of the Contract.
If prior to conversion, agency must attach Computation Worksheet by Pay Period and required data in 1-7 above.
Computation of time of storage (as provided for in paragraph (5) of this section) shall begin at the expiration of such notice.
Computation of all other types of interest and all fees shall be calculated on the basis of a year of 360 days and the actual number of days elapsed, which results in a higher yield to the payee thereof than a method based on a year of 365 or 366 days.
Computation shall be done using financial capacity ratios to analyse this capacity.
More Definitions of Computation
Computation shall have the meaning set forth in Section 7.08(c).
Computation shall have the meaning set forth in Section 2.3.
Computation the computation described in Section 14.7(b). "Consent" - any approval, consent, ratification, waiver, or other authorization or release, including, but not limited to, shareholder approval, board of director approval, third party consent and any Governmental Authorization.
Computation shall have the meaning set forth in Section ----------- 6.5(a).
Computation. For each user, n scalar multiplications in G1, n-1 additions in G1, 1 computation of signature, n-1 and two groups G1 = <P> and G2 of order q, where G1 is a bilinear group with a bilinear map e : G1 × G1 → G2. Additionally, we assume that the discrete logarithm problems (DLP) in both G1 and G2 are hard. The bilinear Xxxxxx-Xxxxxxx assumption says for all probabilistic polynomial time adversary A, Pr[(q,P) ← Gen(1λ); A(P,aP,bP,cP) = x:x = e(P,P)abc] is negligible.
Computation as defined in Section 6.3(e)(iii).