| http://www.w3.org/ns/prov#value | - A method for performing modulo arithmetic as in claim 11, wherein N is an integer which is equal to a total number of bits in the mask value, and N is equal to or greater than X, the method further comprising the steps of:storing X consecutive least significant bits of the mask value in a register, where each of the X consecutive least significant bits of the mask value is equal to one; and storin
|
